./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_09_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c97cc1a04ee6dfa2839891d47fcb132b8d0ef4f17f26b448801c6c954078a367 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 17:25:48,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:25:48,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:25:48,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:25:48,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:25:48,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:25:48,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:25:48,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:25:48,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:25:48,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:25:48,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:25:48,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:25:48,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:25:48,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:25:48,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:25:48,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:25:48,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:25:48,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:25:48,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:25:48,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:25:48,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:25:48,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:25:48,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:25:48,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:25:48,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:25:48,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:25:48,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:25:48,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:25:48,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:25:48,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:25:48,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:25:48,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:25:48,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:25:48,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:25:48,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:25:48,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:25:48,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:25:48,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:25:48,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:25:48,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:25:48,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:25:48,286 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-21 17:25:48,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:25:48,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:25:48,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:25:48,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:25:48,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:25:48,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:25:48,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:25:48,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:25:48,333 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:25:48,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:25:48,335 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:25:48,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:25:48,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:25:48,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:25:48,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:25:48,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:25:48,336 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 17:25:48,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:25:48,336 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:25:48,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:25:48,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:25:48,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:25:48,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:25:48,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:25:48,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:25:48,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:25:48,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:25:48,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:25:48,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:25:48,339 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:25:48,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:25:48,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:25:48,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/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_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c97cc1a04ee6dfa2839891d47fcb132b8d0ef4f17f26b448801c6c954078a367 [2022-11-21 17:25:48,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:25:48,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:25:48,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:25:48,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:25:48,619 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:25:48,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_09_good.i [2022-11-21 17:25:51,655 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:25:52,062 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:25:52,063 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_09_good.i [2022-11-21 17:25:52,094 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/data/0efa97da8/e1dba8e7c6c54aa3942a889f2d0000b5/FLAG52d5f7568 [2022-11-21 17:25:52,115 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/data/0efa97da8/e1dba8e7c6c54aa3942a889f2d0000b5 [2022-11-21 17:25:52,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:25:52,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:25:52,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:25:52,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:25:52,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:25:52,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:25:52" (1/1) ... [2022-11-21 17:25:52,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d14002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:52, skipping insertion in model container [2022-11-21 17:25:52,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:25:52" (1/1) ... [2022-11-21 17:25:52,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:25:52,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:25:52,599 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-21 17:25:53,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:25:53,289 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:25:53,308 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-21 17:25:53,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:25:53,558 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:25:53,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53 WrapperNode [2022-11-21 17:25:53,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:25:53,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:25:53,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:25:53,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:25:53,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,642 INFO L138 Inliner]: procedures = 504, calls = 85, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 119 [2022-11-21 17:25:53,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:25:53,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:25:53,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:25:53,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:25:53,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,675 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:25:53,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:25:53,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:25:53,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:25:53,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (1/1) ... [2022-11-21 17:25:53,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:25:53,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:25:53,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:25:53,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:25:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-21 17:25:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-21 17:25:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-21 17:25:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-21 17:25:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-21 17:25:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:25:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-21 17:25:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:25:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:25:53,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:25:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:25:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-21 17:25:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:25:54,037 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:25:54,039 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:25:54,256 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:25:54,263 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:25:54,263 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 17:25:54,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:25:54 BoogieIcfgContainer [2022-11-21 17:25:54,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:25:54,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:25:54,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:25:54,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:25:54,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:25:52" (1/3) ... [2022-11-21 17:25:54,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcb0b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:25:54, skipping insertion in model container [2022-11-21 17:25:54,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:25:53" (2/3) ... [2022-11-21 17:25:54,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcb0b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:25:54, skipping insertion in model container [2022-11-21 17:25:54,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:25:54" (3/3) ... [2022-11-21 17:25:54,283 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_09_good.i [2022-11-21 17:25:54,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:25:54,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-21 17:25:54,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:25:54,380 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6067c67f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:25:54,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-21 17:25:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-21 17:25:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 17:25:54,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:54,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:54,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:25:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash -3411870, now seen corresponding path program 1 times [2022-11-21 17:25:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:54,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800445143] [2022-11-21 17:25:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:54,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800445143] [2022-11-21 17:25:54,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800445143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:54,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:54,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352867852] [2022-11-21 17:25:54,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:25:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:54,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:25:54,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:25:54,782 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:25:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:54,840 INFO L93 Difference]: Finished difference Result 114 states and 154 transitions. [2022-11-21 17:25:54,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:25:54,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-21 17:25:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:54,854 INFO L225 Difference]: With dead ends: 114 [2022-11-21 17:25:54,855 INFO L226 Difference]: Without dead ends: 53 [2022-11-21 17:25:54,866 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 [2022-11-21 17:25:54,870 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:54,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-21 17:25:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-21 17:25:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 46 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-21 17:25:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-21 17:25:54,916 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 12 [2022-11-21 17:25:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:54,918 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-21 17:25:54,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:25:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-21 17:25:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 17:25:54,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:54,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:54,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:25:54,921 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)] === [2022-11-21 17:25:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 716579271, now seen corresponding path program 1 times [2022-11-21 17:25:54,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:54,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507431486] [2022-11-21 17:25:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:55,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:55,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507431486] [2022-11-21 17:25:55,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507431486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:55,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:55,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671842655] [2022-11-21 17:25:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:55,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:55,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:55,137 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:25:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:55,187 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-11-21 17:25:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:55,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-21 17:25:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:55,189 INFO L225 Difference]: With dead ends: 53 [2022-11-21 17:25:55,191 INFO L226 Difference]: Without dead ends: 52 [2022-11-21 17:25:55,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:55,192 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:55,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-21 17:25:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-21 17:25:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.393939393939394) internal successors, (46), 45 states have internal predecessors, (46), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-21 17:25:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-11-21 17:25:55,206 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 14 [2022-11-21 17:25:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:55,209 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-11-21 17:25:55,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:25:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-11-21 17:25:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 17:25:55,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:55,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:25:55,215 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)] === [2022-11-21 17:25:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 739120992, now seen corresponding path program 1 times [2022-11-21 17:25:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:55,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140642153] [2022-11-21 17:25:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140642153] [2022-11-21 17:25:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140642153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:55,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:55,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:25:55,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500913945] [2022-11-21 17:25:55,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:55,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:25:55,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:55,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:25:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:25:55,363 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:25:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:55,379 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-11-21 17:25:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:25:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-21 17:25:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:55,381 INFO L225 Difference]: With dead ends: 52 [2022-11-21 17:25:55,381 INFO L226 Difference]: Without dead ends: 51 [2022-11-21 17:25:55,382 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 [2022-11-21 17:25:55,383 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:55,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-21 17:25:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-21 17:25:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 44 states have internal predecessors, (45), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-21 17:25:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-11-21 17:25:55,395 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 15 [2022-11-21 17:25:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:55,396 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-11-21 17:25:55,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:25:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-11-21 17:25:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 17:25:55,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:55,398 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] [2022-11-21 17:25:55,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:25:55,399 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:25:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1877659523, now seen corresponding path program 1 times [2022-11-21 17:25:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:55,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411781321] [2022-11-21 17:25:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:25:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 17:25:55,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:55,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411781321] [2022-11-21 17:25:55,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411781321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:55,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:55,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944962687] [2022-11-21 17:25:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:55,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:25:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:25:55,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:25:55,545 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:25:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:55,570 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2022-11-21 17:25:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:25:55,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 24 [2022-11-21 17:25:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:55,572 INFO L225 Difference]: With dead ends: 86 [2022-11-21 17:25:55,573 INFO L226 Difference]: Without dead ends: 49 [2022-11-21 17:25:55,574 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 [2022-11-21 17:25:55,575 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 57 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 [2022-11-21 17:25:55,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-21 17:25:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-21 17:25:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.303030303030303) internal successors, (43), 42 states have internal predecessors, (43), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:25:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-11-21 17:25:55,586 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 24 [2022-11-21 17:25:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:55,586 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-11-21 17:25:55,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:25:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-11-21 17:25:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 17:25:55,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:55,588 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:55,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:25:55,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:25:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1029008232, now seen corresponding path program 1 times [2022-11-21 17:25:55,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:55,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227308647] [2022-11-21 17:25:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:55,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:25:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 17:25:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:55,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227308647] [2022-11-21 17:25:55,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227308647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:55,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:55,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105634384] [2022-11-21 17:25:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:55,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:55,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:55,691 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:25:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:55,717 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-11-21 17:25:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:55,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-21 17:25:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:55,719 INFO L225 Difference]: With dead ends: 49 [2022-11-21 17:25:55,720 INFO L226 Difference]: Without dead ends: 48 [2022-11-21 17:25:55,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:55,721 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:55,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 135 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-21 17:25:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-21 17:25:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 41 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:25:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-11-21 17:25:55,732 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 25 [2022-11-21 17:25:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:55,732 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-11-21 17:25:55,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:25:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-11-21 17:25:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 17:25:55,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:55,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:55,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:25:55,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:25:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1834484019, now seen corresponding path program 1 times [2022-11-21 17:25:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:55,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262418487] [2022-11-21 17:25:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:25:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 17:25:55,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:55,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262418487] [2022-11-21 17:25:55,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262418487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:55,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:55,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:25:55,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696838258] [2022-11-21 17:25:55,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:55,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:25:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:25:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:25:55,814 INFO L87 Difference]: Start difference. First operand 48 states and 58 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:25:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:55,826 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-11-21 17:25:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:25:55,827 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-21 17:25:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:55,828 INFO L225 Difference]: With dead ends: 48 [2022-11-21 17:25:55,828 INFO L226 Difference]: Without dead ends: 47 [2022-11-21 17:25:55,829 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 [2022-11-21 17:25:55,830 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:55,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-21 17:25:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-21 17:25:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 40 states have internal predecessors, (41), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:25:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-11-21 17:25:55,837 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 26 [2022-11-21 17:25:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:55,838 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-11-21 17:25:55,838 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:25:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-11-21 17:25:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 17:25:55,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:55,839 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] [2022-11-21 17:25:55,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:25:55,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:25:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1863024089, now seen corresponding path program 1 times [2022-11-21 17:25:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:55,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434672169] [2022-11-21 17:25:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:55,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:25:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:25:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 17:25:55,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:55,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434672169] [2022-11-21 17:25:55,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434672169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:55,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:55,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886233885] [2022-11-21 17:25:55,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:55,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:55,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:55,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:55,952 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 17:25:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:55,986 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-11-21 17:25:55,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 33 [2022-11-21 17:25:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:55,988 INFO L225 Difference]: With dead ends: 47 [2022-11-21 17:25:55,988 INFO L226 Difference]: Without dead ends: 46 [2022-11-21 17:25:55,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:55,989 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 146 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 [2022-11-21 17:25:55,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 146 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-21 17:25:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-21 17:25:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 39 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:25:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-21 17:25:55,998 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 33 [2022-11-21 17:25:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:55,998 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-21 17:25:55,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 17:25:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-21 17:25:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 17:25:56,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:56,000 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] [2022-11-21 17:25:56,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:25:56,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:25:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1919171787, now seen corresponding path program 1 times [2022-11-21 17:25:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:56,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847485242] [2022-11-21 17:25:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:25:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:25:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 17:25:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:56,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847485242] [2022-11-21 17:25:56,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847485242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:56,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:56,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:56,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753111974] [2022-11-21 17:25:56,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:56,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:56,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:56,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:56,088 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 17:25:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:56,109 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-21 17:25:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:56,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 34 [2022-11-21 17:25:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:56,110 INFO L225 Difference]: With dead ends: 46 [2022-11-21 17:25:56,111 INFO L226 Difference]: Without dead ends: 45 [2022-11-21 17:25:56,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:56,112 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:56,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-21 17:25:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-21 17:25:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 38 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:25:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-11-21 17:25:56,120 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 34 [2022-11-21 17:25:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:56,120 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-11-21 17:25:56,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 17:25:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-11-21 17:25:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-21 17:25:56,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:56,122 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:56,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:25:56,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:25:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash -284591334, now seen corresponding path program 1 times [2022-11-21 17:25:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:56,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874101601] [2022-11-21 17:25:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:56,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:25:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:25:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-21 17:25:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 17:25:56,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:56,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874101601] [2022-11-21 17:25:56,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874101601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:56,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:56,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727283789] [2022-11-21 17:25:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:56,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:56,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:56,210 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 17:25:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:56,227 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-11-21 17:25:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 42 [2022-11-21 17:25:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:56,229 INFO L225 Difference]: With dead ends: 45 [2022-11-21 17:25:56,229 INFO L226 Difference]: Without dead ends: 44 [2022-11-21 17:25:56,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:56,230 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:56,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-21 17:25:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-21 17:25:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 37 states have internal predecessors, (38), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 17:25:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-11-21 17:25:56,237 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 42 [2022-11-21 17:25:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:56,237 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-11-21 17:25:56,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 17:25:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-11-21 17:25:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 17:25:56,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:56,239 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] [2022-11-21 17:25:56,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:25:56,240 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 17:25:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash -232396620, now seen corresponding path program 1 times [2022-11-21 17:25:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712042823] [2022-11-21 17:25:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:25:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:25:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:25:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-21 17:25:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 17:25:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:56,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712042823] [2022-11-21 17:25:56,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712042823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:56,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:56,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409765690] [2022-11-21 17:25:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:56,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:56,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:56,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:56,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:56,355 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 17:25:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:56,377 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-11-21 17:25:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 43 [2022-11-21 17:25:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:56,381 INFO L225 Difference]: With dead ends: 44 [2022-11-21 17:25:56,382 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 17:25:56,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:56,383 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:56,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:25:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 17:25:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 17:25:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 17:25:56,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-11-21 17:25:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:56,387 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 17:25:56,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 17:25:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 17:25:56,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 17:25:56,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-21 17:25:56,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-21 17:25:56,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-21 17:25:56,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-21 17:25:56,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-21 17:25:56,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-21 17:25:56,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-21 17:25:56,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-21 17:25:56,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:25:56,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 17:25:56,496 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-21 17:25:56,496 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-21 17:25:56,496 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-21 17:25:56,497 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-21 17:25:56,497 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-21 17:25:56,497 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-21 17:25:56,497 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-21 17:25:56,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1606) no Hoare annotation was computed. [2022-11-21 17:25:56,498 INFO L899 garLoopResultBuilder]: For program point L1654(lines 1654 1660) no Hoare annotation was computed. [2022-11-21 17:25:56,498 INFO L899 garLoopResultBuilder]: For program point L1588(lines 1588 1601) no Hoare annotation was computed. [2022-11-21 17:25:56,499 INFO L899 garLoopResultBuilder]: For program point L1588-2(lines 1585 1615) no Hoare annotation was computed. [2022-11-21 17:25:56,499 INFO L895 garLoopResultBuilder]: At program point L1580(line 1580) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-21 17:25:56,499 INFO L899 garLoopResultBuilder]: For program point L1580-1(lines 1566 1582) no Hoare annotation was computed. [2022-11-21 17:25:56,499 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1648) no Hoare annotation was computed. [2022-11-21 17:25:56,500 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1581) no Hoare annotation was computed. [2022-11-21 17:25:56,500 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-21 17:25:56,500 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 17:25:56,500 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 17:25:56,500 INFO L895 garLoopResultBuilder]: At program point L1622(line 1622) the Hoare annotation is: false [2022-11-21 17:25:56,500 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-11-21 17:25:56,500 INFO L899 garLoopResultBuilder]: For program point L1606(line 1606) no Hoare annotation was computed. [2022-11-21 17:25:56,501 INFO L899 garLoopResultBuilder]: For program point L1606-1(line 1606) no Hoare annotation was computed. [2022-11-21 17:25:56,501 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-21 17:25:56,501 INFO L895 garLoopResultBuilder]: At program point L1664(line 1664) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1)) [2022-11-21 17:25:56,501 INFO L899 garLoopResultBuilder]: For program point L1664-1(line 1664) no Hoare annotation was computed. [2022-11-21 17:25:56,501 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-21 17:25:56,501 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 17:25:56,502 INFO L899 garLoopResultBuilder]: For program point L1631-1(line 1631) no Hoare annotation was computed. [2022-11-21 17:25:56,502 INFO L899 garLoopResultBuilder]: For program point L1598-1(lines 1592 1599) no Hoare annotation was computed. [2022-11-21 17:25:56,502 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-21 17:25:56,502 INFO L899 garLoopResultBuilder]: For program point L1648-1(line 1648) no Hoare annotation was computed. [2022-11-21 17:25:56,502 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-21 17:25:56,502 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-11-21 17:25:56,502 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1636) no Hoare annotation was computed. [2022-11-21 17:25:56,503 INFO L899 garLoopResultBuilder]: For program point L1641(lines 1641 1644) no Hoare annotation was computed. [2022-11-21 17:25:56,503 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 17:25:56,503 INFO L899 garLoopResultBuilder]: For program point L1641-2(lines 1638 1653) no Hoare annotation was computed. [2022-11-21 17:25:56,503 INFO L895 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: (= ~GLOBAL_CONST_TRUE~0 1) [2022-11-21 17:25:56,503 INFO L895 garLoopResultBuilder]: At program point L1633(line 1633) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 17:25:56,503 INFO L899 garLoopResultBuilder]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2022-11-21 17:25:56,504 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1599) no Hoare annotation was computed. [2022-11-21 17:25:56,504 INFO L895 garLoopResultBuilder]: At program point L1650(line 1650) the Hoare annotation is: (= ~GLOBAL_CONST_TRUE~0 1) [2022-11-21 17:25:56,504 INFO L899 garLoopResultBuilder]: For program point L1584(lines 1584 1615) no Hoare annotation was computed. [2022-11-21 17:25:56,504 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-21 17:25:56,504 INFO L895 garLoopResultBuilder]: At program point L1667(lines 1661 1668) the Hoare annotation is: (= ~GLOBAL_CONST_TRUE~0 1) [2022-11-21 17:25:56,504 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-21 17:25:56,504 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 17:25:56,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1631) no Hoare annotation was computed. [2022-11-21 17:25:56,505 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1565) no Hoare annotation was computed. [2022-11-21 17:25:56,505 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1549 1583) no Hoare annotation was computed. [2022-11-21 17:25:56,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 17:25:56,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1631) no Hoare annotation was computed. [2022-11-21 17:25:56,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1606) no Hoare annotation was computed. [2022-11-21 17:25:56,506 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-21 17:25:56,506 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-11-21 17:25:56,506 INFO L899 garLoopResultBuilder]: For program point L1620(lines 1620 1627) no Hoare annotation was computed. [2022-11-21 17:25:56,506 INFO L899 garLoopResultBuilder]: For program point L1620-1(lines 1617 1636) no Hoare annotation was computed. [2022-11-21 17:25:56,507 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= ~GLOBAL_CONST_TRUE~0 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 17:25:56,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1648) no Hoare annotation was computed. [2022-11-21 17:25:56,513 INFO L899 garLoopResultBuilder]: For program point L1637(lines 1637 1653) no Hoare annotation was computed. [2022-11-21 17:25:56,513 INFO L899 garLoopResultBuilder]: For program point L1604(lines 1604 1613) no Hoare annotation was computed. [2022-11-21 17:25:56,516 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:56,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:25:56,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:25:56 BoogieIcfgContainer [2022-11-21 17:25:56,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:25:56,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:25:56,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:25:56,534 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:25:56,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:25:54" (3/4) ... [2022-11-21 17:25:56,537 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 17:25:56,544 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-21 17:25:56,544 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-21 17:25:56,551 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-21 17:25:56,552 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-21 17:25:56,552 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-21 17:25:56,553 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 17:25:56,553 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 17:25:56,596 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:25:56,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:25:56,597 INFO L158 Benchmark]: Toolchain (without parser) took 4477.28ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 95.9MB in the beginning and 71.4MB in the end (delta: 24.5MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2022-11-21 17:25:56,597 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 144.7MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:25:56,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1437.14ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 95.6MB in the beginning and 124.6MB in the end (delta: -29.0MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2022-11-21 17:25:56,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.86ms. Allocated memory is still 186.6MB. Free memory was 124.6MB in the beginning and 121.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:25:56,598 INFO L158 Benchmark]: Boogie Preprocessor took 36.15ms. Allocated memory is still 186.6MB. Free memory was 121.3MB in the beginning and 119.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:25:56,599 INFO L158 Benchmark]: RCFGBuilder took 585.10ms. Allocated memory is still 186.6MB. Free memory was 119.2MB in the beginning and 103.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 17:25:56,599 INFO L158 Benchmark]: TraceAbstraction took 2256.93ms. Allocated memory is still 186.6MB. Free memory was 102.4MB in the beginning and 75.6MB in the end (delta: 26.8MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-11-21 17:25:56,599 INFO L158 Benchmark]: Witness Printer took 63.17ms. Allocated memory is still 186.6MB. Free memory was 75.6MB in the beginning and 71.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:25:56,601 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 144.7MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1437.14ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 95.6MB in the beginning and 124.6MB in the end (delta: -29.0MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.86ms. Allocated memory is still 186.6MB. Free memory was 124.6MB in the beginning and 121.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.15ms. Allocated memory is still 186.6MB. Free memory was 121.3MB in the beginning and 119.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 585.10ms. Allocated memory is still 186.6MB. Free memory was 119.2MB in the beginning and 103.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2256.93ms. Allocated memory is still 186.6MB. Free memory was 102.4MB in the beginning and 75.6MB in the end (delta: 26.8MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 63.17ms. Allocated memory is still 186.6MB. Free memory was 75.6MB in the beginning and 71.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1648]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1648]: 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, 61 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 668 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 566 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 39 PreInvPairs, 48 NumberOfFragments, 107 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 60/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1661]: Loop Invariant Derived loop invariant: GLOBAL_CONST_TRUE == 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 17:25:56,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ce3b74-70f8-4ced-8a71-4d55a62d83c3/bin/uautomizer-vX5HgA9Q3a/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