./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc 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_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_65_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya --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 7c3324437e341d7b098e9dbe6dd9e58a346a05f3c2760e7195364eab0a0f1d45 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:10:08,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:10:08,749 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-29 00:10:08,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:10:08,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:10:08,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:10:08,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:10:08,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:10:08,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:10:08,781 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:10:08,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:10:08,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:10:08,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:10:08,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:10:08,784 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:10:08,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:10:08,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:10:08,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:10:08,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:10:08,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:10:08,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:10:08,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:10:08,788 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 00:10:08,788 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:10:08,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:10:08,789 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:10:08,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:10:08,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:10:08,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:10:08,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:10:08,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:10:08,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:10:08,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:10:08,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:10:08,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:10:08,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:10:08,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:10:08,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:10:08,794 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:10:08,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:10:08,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:10:08,794 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_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/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_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 7c3324437e341d7b098e9dbe6dd9e58a346a05f3c2760e7195364eab0a0f1d45 [2023-11-29 00:10:09,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:10:09,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:10:09,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:10:09,054 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:10:09,054 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:10:09,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_65_good.i [2023-11-29 00:10:11,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:10:12,054 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:10:12,054 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_65_good.i [2023-11-29 00:10:12,080 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/data/fddf5e001/9a143fe23cbf4d309dda756c65f9fc29/FLAGce38b77e3 [2023-11-29 00:10:12,094 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/data/fddf5e001/9a143fe23cbf4d309dda756c65f9fc29 [2023-11-29 00:10:12,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:10:12,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:10:12,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:10:12,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:10:12,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:10:12,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:12" (1/1) ... [2023-11-29 00:10:12,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e63f8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:12, skipping insertion in model container [2023-11-29 00:10:12,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:12" (1/1) ... [2023-11-29 00:10:12,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:10:12,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:10:12,929 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:10:13,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:10:13,153 WARN L675 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:10:13,153 WARN L675 CHandler]: The function __ctype_b_loc is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:10:13,153 WARN L675 CHandler]: The function iswxdigit is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:10:13,154 WARN L675 CHandler]: The function funcPtr is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:10:13,154 WARN L675 CHandler]: The function time is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:10:13,154 WARN L675 CHandler]: The function fgets is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:10:13,160 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:10:13,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13 WrapperNode [2023-11-29 00:10:13,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:10:13,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:10:13,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:10:13,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:10:13,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,212 INFO L138 Inliner]: procedures = 504, calls = 72, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 81 [2023-11-29 00:10:13,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:10:13,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:10:13,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:10:13,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:10:13,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,239 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [1, 1, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1, 0]. The 2 writes are split as follows [0, 0, 2]. [2023-11-29 00:10:13,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:10:13,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:10:13,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:10:13,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:10:13,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (1/1) ... [2023-11-29 00:10:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:10:13,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:10:13,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:10:13,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:10:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2023-11-29 00:10:13,307 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2023-11-29 00:10:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2023-11-29 00:10:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2023-11-29 00:10:13,307 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2023-11-29 00:10:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:10:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-29 00:10:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-29 00:10:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-29 00:10:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:10:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2023-11-29 00:10:13,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2023-11-29 00:10:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:10:13,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:10:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:10:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure time [2023-11-29 00:10:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:10:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:10:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:10:13,462 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:10:13,464 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:10:13,602 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:10:13,631 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:10:13,631 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:10:13,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:13 BoogieIcfgContainer [2023-11-29 00:10:13,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:10:13,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:10:13,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:10:13,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:10:13,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:10:12" (1/3) ... [2023-11-29 00:10:13,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bb083d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:10:13, skipping insertion in model container [2023-11-29 00:10:13,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:13" (2/3) ... [2023-11-29 00:10:13,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bb083d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:10:13, skipping insertion in model container [2023-11-29 00:10:13,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:13" (3/3) ... [2023-11-29 00:10:13,641 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_65_good.i [2023-11-29 00:10:13,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:10:13,655 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-29 00:10:13,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:10:13,710 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;@470c3872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:10:13,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 00:10:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:10:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 00:10:13,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:10:13,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:13,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 00:10:13,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:13,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1518360961, now seen corresponding path program 1 times [2023-11-29 00:10:13,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:13,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697726217] [2023-11-29 00:10:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:10:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,075 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-29 00:10:14,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:14,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697726217] [2023-11-29 00:10:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697726217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:14,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:14,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:10:14,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050555733] [2023-11-29 00:10:14,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:14,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:10:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:10:14,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:10:14,114 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:10:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:10:14,229 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2023-11-29 00:10:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:10:14,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 00:10:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:10:14,239 INFO L225 Difference]: With dead ends: 60 [2023-11-29 00:10:14,239 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 00:10:14,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:10:14,244 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:10:14,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 185 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:10:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 00:10:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2023-11-29 00:10:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 00:10:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2023-11-29 00:10:14,277 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 11 [2023-11-29 00:10:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:10:14,278 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2023-11-29 00:10:14,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:10:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2023-11-29 00:10:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:10:14,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:10:14,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:14,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:10:14,281 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 00:10:14,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 175433707, now seen corresponding path program 1 times [2023-11-29 00:10:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177310950] [2023-11-29 00:10:14,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:14,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:10:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,401 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-29 00:10:14,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:14,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177310950] [2023-11-29 00:10:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177310950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:14,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:14,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:10:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104951228] [2023-11-29 00:10:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:14,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:10:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:14,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:10:14,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:10:14,406 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:10:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:10:14,481 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2023-11-29 00:10:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:10:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-29 00:10:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:10:14,483 INFO L225 Difference]: With dead ends: 67 [2023-11-29 00:10:14,483 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 00:10:14,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:10:14,485 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:10:14,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 130 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:10:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 00:10:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 00:10:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 31 states have internal predecessors, (34), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:10:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-11-29 00:10:14,495 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2023-11-29 00:10:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:10:14,495 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-11-29 00:10:14,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:10:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-11-29 00:10:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:10:14,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:10:14,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:14,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:10:14,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 00:10:14,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 100394410, now seen corresponding path program 1 times [2023-11-29 00:10:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:14,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181249192] [2023-11-29 00:10:14,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:10:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:10:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:10:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:10:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181249192] [2023-11-29 00:10:14,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181249192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:14,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:14,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:10:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131666099] [2023-11-29 00:10:14,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:14,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:10:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:10:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:10:14,663 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:10:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:10:14,720 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-11-29 00:10:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:10:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 00:10:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:10:14,722 INFO L225 Difference]: With dead ends: 41 [2023-11-29 00:10:14,722 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 00:10:14,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:10:14,724 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:10:14,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 157 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:10:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 00:10:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-11-29 00:10:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:10:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-11-29 00:10:14,732 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 25 [2023-11-29 00:10:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:10:14,733 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-11-29 00:10:14,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:10:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-11-29 00:10:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:10:14,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:10:14,734 INFO L195 NwaCegarLoop]: trace histogram [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-29 00:10:14,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:10:14,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 00:10:14,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1182757344, now seen corresponding path program 1 times [2023-11-29 00:10:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:14,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437068639] [2023-11-29 00:10:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:10:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:10:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:10:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:10:14,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:14,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437068639] [2023-11-29 00:10:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437068639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:14,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:14,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:10:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475271606] [2023-11-29 00:10:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:14,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:10:14,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:14,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:10:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:10:14,869 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:10:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:10:14,929 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-11-29 00:10:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:10:14,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-11-29 00:10:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:10:14,930 INFO L225 Difference]: With dead ends: 40 [2023-11-29 00:10:14,931 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 00:10:14,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:10:14,932 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:10:14,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 149 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:10:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 00:10:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-29 00:10:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:10:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-29 00:10:14,940 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2023-11-29 00:10:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:10:14,941 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-29 00:10:14,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:10:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-29 00:10:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:10:14,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:10:14,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:14,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:10:14,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 00:10:14,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1182740495, now seen corresponding path program 1 times [2023-11-29 00:10:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982551012] [2023-11-29 00:10:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:15,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:10:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:15,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:10:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:15,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:10:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:10:15,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:15,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982551012] [2023-11-29 00:10:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982551012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:15,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:10:15,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6025510] [2023-11-29 00:10:15,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:15,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:10:15,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:10:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:10:15,091 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:10:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:10:15,122 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-11-29 00:10:15,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:10:15,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-11-29 00:10:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:10:15,125 INFO L225 Difference]: With dead ends: 41 [2023-11-29 00:10:15,125 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 00:10:15,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:10:15,126 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:10:15,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:10:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 00:10:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-11-29 00:10:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:10:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-29 00:10:15,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2023-11-29 00:10:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:10:15,135 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-29 00:10:15,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:10:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-29 00:10:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 00:10:15,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:10:15,136 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:10:15,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:10:15,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 00:10:15,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1989228077, now seen corresponding path program 1 times [2023-11-29 00:10:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300396127] [2023-11-29 00:10:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:15,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:10:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:15,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:10:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:15,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:10:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:10:15,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:15,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300396127] [2023-11-29 00:10:15,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300396127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:15,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:15,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:10:15,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947238438] [2023-11-29 00:10:15,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:15,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:10:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:15,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:10:15,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:10:15,206 INFO L87 Difference]: Start difference. First operand 36 states and 40 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:10:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:10:15,222 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-11-29 00:10:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:10:15,222 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-11-29 00:10:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:10:15,223 INFO L225 Difference]: With dead ends: 36 [2023-11-29 00:10:15,223 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:10:15,224 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-29 00:10:15,224 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:10:15,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:10:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:10:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:10:15,226 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-29 00:10:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:10:15,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2023-11-29 00:10:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:10:15,226 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:10:15,226 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:10:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:10:15,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:10:15,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-11-29 00:10:15,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-11-29 00:10:15,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-11-29 00:10:15,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-11-29 00:10:15,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:10:15,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:10:15,302 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2023-11-29 00:10:15,302 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2023-11-29 00:10:15,302 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2023-11-29 00:10:15,302 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2023-11-29 00:10:15,302 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2023-11-29 00:10:15,303 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2023-11-29 00:10:15,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:10:15,303 INFO L899 garLoopResultBuilder]: For program point L1565(lines 1565 1572) no Hoare annotation was computed. [2023-11-29 00:10:15,303 INFO L899 garLoopResultBuilder]: For program point L1565-2(lines 1565 1572) no Hoare annotation was computed. [2023-11-29 00:10:15,303 INFO L895 garLoopResultBuilder]: At program point L1555(line 1555) the Hoare annotation is: (= |ULTIMATE.start_goodG2B_~data~0#1| 2) [2023-11-29 00:10:15,304 INFO L899 garLoopResultBuilder]: For program point L1555-1(lines 1549 1556) no Hoare annotation was computed. [2023-11-29 00:10:15,304 INFO L902 garLoopResultBuilder]: At program point L1586(line 1586) the Hoare annotation is: true [2023-11-29 00:10:15,304 INFO L899 garLoopResultBuilder]: For program point L1586-1(line 1586) no Hoare annotation was computed. [2023-11-29 00:10:15,304 INFO L902 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: true [2023-11-29 00:10:15,304 INFO L899 garLoopResultBuilder]: For program point L1584-1(line 1584) no Hoare annotation was computed. [2023-11-29 00:10:15,304 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:10:15,305 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: (and (= |#funAddr~CWE190_Integer_Overflow__int_fgets_add_65b_goodB2GSink.base| |ULTIMATE.start_goodB2G_~funcPtr~1#1.base|) (<= 0 (+ |ULTIMATE.start_goodB2G_~data~1#1| 2147483648)) (= |ULTIMATE.start_goodB2G_~funcPtr~1#1.offset| |#funAddr~CWE190_Integer_Overflow__int_fgets_add_65b_goodB2GSink.offset|)) [2023-11-29 00:10:15,305 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1558 1575) no Hoare annotation was computed. [2023-11-29 00:10:15,305 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (and (= |#funAddr~CWE190_Integer_Overflow__int_fgets_add_65b_goodB2GSink.base| |ULTIMATE.start_goodB2G_~funcPtr~1#1.base|) (<= 0 (+ |ULTIMATE.start_goodB2G_~data~1#1| 2147483648)) (= |ULTIMATE.start_goodB2G_~funcPtr~1#1.offset| |#funAddr~CWE190_Integer_Overflow__int_fgets_add_65b_goodB2GSink.offset|)) [2023-11-29 00:10:15,305 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2023-11-29 00:10:15,305 INFO L899 garLoopResultBuilder]: For program point L1600(line 1600) no Hoare annotation was computed. [2023-11-29 00:10:15,305 INFO L899 garLoopResultBuilder]: For program point L1600-1(line 1600) no Hoare annotation was computed. [2023-11-29 00:10:15,306 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1606) no Hoare annotation was computed. [2023-11-29 00:10:15,306 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2023-11-29 00:10:15,306 INFO L899 garLoopResultBuilder]: For program point L1592(line 1592) no Hoare annotation was computed. [2023-11-29 00:10:15,306 INFO L899 garLoopResultBuilder]: For program point L1592-1(line 1592) no Hoare annotation was computed. [2023-11-29 00:10:15,306 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1592) no Hoare annotation was computed. [2023-11-29 00:10:15,306 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1600) no Hoare annotation was computed. [2023-11-29 00:10:15,306 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:10:15,307 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-11-29 00:10:15,307 INFO L895 garLoopResultBuilder]: At program point L1605(line 1605) the Hoare annotation is: (not (= 2 |##fun~int~TO~VOID_#in~102#1|)) [2023-11-29 00:10:15,307 INFO L899 garLoopResultBuilder]: For program point L1605-1(line 1605) no Hoare annotation was computed. [2023-11-29 00:10:15,307 INFO L895 garLoopResultBuilder]: At program point L1601(line 1601) the Hoare annotation is: (or (and (= |#funAddr~CWE190_Integer_Overflow__int_fgets_add_65b_goodB2GSink.base| |##fun~int~TO~VOID_#in~#fp#1.base|) (= 2 |##fun~int~TO~VOID_#~102#1|) (= |#funAddr~CWE190_Integer_Overflow__int_fgets_add_65b_goodB2GSink.offset| |##fun~int~TO~VOID_#in~#fp#1.offset|) (= 2 |##fun~int~TO~VOID_CWE190_Integer_Overflow__int_fgets_add_65b_goodB2GSink_~data#1|)) (not (= 2 |##fun~int~TO~VOID_#in~102#1|))) [2023-11-29 00:10:15,307 INFO L899 garLoopResultBuilder]: For program point L1601-1(line 1601) no Hoare annotation was computed. [2023-11-29 00:10:15,307 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-29 00:10:15,307 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2023-11-29 00:10:15,308 INFO L895 garLoopResultBuilder]: At program point L1593(line 1593) the Hoare annotation is: (or (and (= 2 |##fun~int~TO~VOID_CWE190_Integer_Overflow__int_fgets_add_65b_goodG2BSink_~data#1|) (= 2 |##fun~int~TO~VOID_#~102#1|)) (not (= 2 |##fun~int~TO~VOID_#in~102#1|))) [2023-11-29 00:10:15,308 INFO L899 garLoopResultBuilder]: For program point L1593-1(line 1593) no Hoare annotation was computed. [2023-11-29 00:10:15,308 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1592) no Hoare annotation was computed. [2023-11-29 00:10:15,308 INFO L899 garLoopResultBuilder]: For program point ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1600) no Hoare annotation was computed. [2023-11-29 00:10:15,311 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 00:10:15,314 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:10:15,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:10:15 BoogieIcfgContainer [2023-11-29 00:10:15,318 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:10:15,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:10:15,319 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:10:15,319 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:10:15,320 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:13" (3/4) ... [2023-11-29 00:10:15,322 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:10:15,326 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2023-11-29 00:10:15,326 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2023-11-29 00:10:15,326 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2023-11-29 00:10:15,331 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-29 00:10:15,331 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-29 00:10:15,332 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 00:10:15,332 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:10:15,421 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:10:15,421 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:10:15,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:10:15,422 INFO L158 Benchmark]: Toolchain (without parser) took 3324.18ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 105.2MB in the beginning and 150.8MB in the end (delta: -45.6MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2023-11-29 00:10:15,423 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:10:15,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1061.14ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 105.2MB in the beginning and 142.0MB in the end (delta: -36.7MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2023-11-29 00:10:15,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.16ms. Allocated memory is still 205.5MB. Free memory was 142.0MB in the beginning and 138.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:10:15,424 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 205.5MB. Free memory was 138.8MB in the beginning and 136.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:10:15,424 INFO L158 Benchmark]: RCFGBuilder took 378.33ms. Allocated memory is still 205.5MB. Free memory was 136.7MB in the beginning and 119.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 00:10:15,425 INFO L158 Benchmark]: TraceAbstraction took 1683.99ms. Allocated memory is still 205.5MB. Free memory was 119.9MB in the beginning and 156.0MB in the end (delta: -36.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:10:15,425 INFO L158 Benchmark]: Witness Printer took 102.66ms. Allocated memory is still 205.5MB. Free memory was 156.0MB in the beginning and 150.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:10:15,427 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.14ms. Allocated memory is still 153.1MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1061.14ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 105.2MB in the beginning and 142.0MB in the end (delta: -36.7MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.16ms. Allocated memory is still 205.5MB. Free memory was 142.0MB in the beginning and 138.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 205.5MB. Free memory was 138.8MB in the beginning and 136.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.33ms. Allocated memory is still 205.5MB. Free memory was 136.7MB in the beginning and 119.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1683.99ms. Allocated memory is still 205.5MB. Free memory was 119.9MB in the beginning and 156.0MB in the end (delta: -36.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 102.66ms. Allocated memory is still 205.5MB. Free memory was 156.0MB in the beginning and 150.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1600]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1600]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: 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 4 procedures, 40 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 754 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 553 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 203 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 201 mSDtfsCounter, 203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=1, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 27 PreInvPairs, 29 NumberOfFragments, 66 HoareAnnotationTreeSize, 27 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 11/11 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 00:10:15,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad2515bf-5c38-4e64-86ba-613306bc6fa9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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