./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_10_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_10_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 48d9dcad757c3507803689fb3ef9b1b63778a56d7f72f26063c5c6799eb914f8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:25:24,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:25:24,288 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-27 23:25:24,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:25:24,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:25:24,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:25:24,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:25:24,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:25:24,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:25:24,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:25:24,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:25:24,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:25:24,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:25:24,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:25:24,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:25:24,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:25:24,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:25:24,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:25:24,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:25:24,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:25:24,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:25:24,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:25:24,346 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-27 23:25:24,346 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:25:24,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:25:24,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:25:24,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:25:24,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:25:24,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:25:24,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:25:24,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:25:24,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:25:24,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:25:24,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:25:24,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:25:24,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:25:24,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:25:24,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:25:24,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:25:24,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:25:24,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:25:24,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:25:24,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:25:24,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:25:24,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:25:24,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:25:24,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:25:24,351 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48d9dcad757c3507803689fb3ef9b1b63778a56d7f72f26063c5c6799eb914f8 [2024-11-27 23:25:24,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:25:24,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:25:24,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:25:24,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:25:24,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:25:24,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_10_good.i [2024-11-27 23:25:27,905 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/data/f6ed03887/5ba96a1ae7914102928ac0234fa4cd6b/FLAG2e9dd5bfe [2024-11-27 23:25:28,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:25:28,544 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_10_good.i [2024-11-27 23:25:28,587 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/data/f6ed03887/5ba96a1ae7914102928ac0234fa4cd6b/FLAG2e9dd5bfe [2024-11-27 23:25:28,615 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/data/f6ed03887/5ba96a1ae7914102928ac0234fa4cd6b [2024-11-27 23:25:28,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:25:28,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:25:28,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:25:28,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:25:28,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:25:28,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:25:28" (1/1) ... [2024-11-27 23:25:28,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272af1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:28, skipping insertion in model container [2024-11-27 23:25:28,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:25:28" (1/1) ... [2024-11-27 23:25:28,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:25:29,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:25:29,820 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:25:29,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:25:30,128 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:25:30,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30 WrapperNode [2024-11-27 23:25:30,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:25:30,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:25:30,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:25:30,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:25:30,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,194 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2024-11-27 23:25:30,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:25:30,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:25:30,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:25:30,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:25:30,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,235 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-27 23:25:30,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:25:30,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:25:30,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:25:30,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:25:30,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (1/1) ... [2024-11-27 23:25:30,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:25:30,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:25:30,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:25:30,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:25:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-27 23:25:30,325 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-27 23:25:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-27 23:25:30,325 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-27 23:25:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:25:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:25:30,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:25:30,541 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:25:30,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:25:30,836 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-27 23:25:30,837 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:25:30,849 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:25:30,849 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:25:30,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:30 BoogieIcfgContainer [2024-11-27 23:25:30,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:25:30,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:25:30,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:25:30,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:25:30,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:25:28" (1/3) ... [2024-11-27 23:25:30,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12541d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:25:30, skipping insertion in model container [2024-11-27 23:25:30,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30" (2/3) ... [2024-11-27 23:25:30,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12541d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:25:30, skipping insertion in model container [2024-11-27 23:25:30,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:30" (3/3) ... [2024-11-27 23:25:30,861 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_predec_10_good.i [2024-11-27 23:25:30,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:25:30,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_predec_10_good.i that has 3 procedures, 59 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2024-11-27 23:25:30,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:25:30,977 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4becb49f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:25:30,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-27 23:25:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-27 23:25:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-27 23:25:30,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:30,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:25:30,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:30,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2010894524, now seen corresponding path program 1 times [2024-11-27 23:25:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:31,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144000926] [2024-11-27 23:25:31,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:25:31,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:31,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144000926] [2024-11-27 23:25:31,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144000926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:31,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:25:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584476797] [2024-11-27 23:25:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:31,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:31,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:31,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:31,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:31,315 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 5.0) 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) [2024-11-27 23:25:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:31,369 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2024-11-27 23:25:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:31,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 [2024-11-27 23:25:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:31,384 INFO L225 Difference]: With dead ends: 108 [2024-11-27 23:25:31,384 INFO L226 Difference]: Without dead ends: 53 [2024-11-27 23:25:31,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:31,394 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:25:31,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-27 23:25:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-27 23:25:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5) internal successors, (51), 44 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-27 23:25:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-27 23:25:31,456 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 12 [2024-11-27 23:25:31,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:31,457 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-27 23:25:31,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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) [2024-11-27 23:25:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-27 23:25:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 23:25:31,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:31,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:25:31,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:25:31,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2086779133, now seen corresponding path program 1 times [2024-11-27 23:25:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:31,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487608803] [2024-11-27 23:25:31,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:31,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:25:31,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487608803] [2024-11-27 23:25:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487608803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:25:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629672611] [2024-11-27 23:25:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:31,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:31,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:31,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:31,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:31,665 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-27 23:25:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:31,692 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-11-27 23:25:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:31,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-27 23:25:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:31,695 INFO L225 Difference]: With dead ends: 52 [2024-11-27 23:25:31,695 INFO L226 Difference]: Without dead ends: 51 [2024-11-27 23:25:31,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:31,696 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:25:31,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 112 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-27 23:25:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-27 23:25:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 43 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-27 23:25:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-11-27 23:25:31,711 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2024-11-27 23:25:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:31,711 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-27 23:25:31,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-27 23:25:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-11-27 23:25:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 23:25:31,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:31,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:25:31,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:25:31,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:31,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1299152580, now seen corresponding path program 1 times [2024-11-27 23:25:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:31,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19074067] [2024-11-27 23:25:31,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:31,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 23:25:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:31,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19074067] [2024-11-27 23:25:31,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19074067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:31,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:25:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108247765] [2024-11-27 23:25:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:31,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:31,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:31,822 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-11-27 23:25:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:31,838 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2024-11-27 23:25:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 20 [2024-11-27 23:25:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:31,839 INFO L225 Difference]: With dead ends: 84 [2024-11-27 23:25:31,839 INFO L226 Difference]: Without dead ends: 48 [2024-11-27 23:25:31,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:31,841 INFO L435 NwaCegarLoop]: 55 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, 55 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 [2024-11-27 23:25:31,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-27 23:25:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-27 23:25:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 41 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:25:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-27 23:25:31,849 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 20 [2024-11-27 23:25:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:31,849 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-27 23:25:31,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-11-27 23:25:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-27 23:25:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-27 23:25:31,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:31,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:25:31,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:25:31,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:31,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1309135630, now seen corresponding path program 1 times [2024-11-27 23:25:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096704569] [2024-11-27 23:25:31,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:31,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 23:25:31,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:31,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096704569] [2024-11-27 23:25:31,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096704569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:31,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:31,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:25:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382061253] [2024-11-27 23:25:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:31,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:31,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:31,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:31,949 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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) [2024-11-27 23:25:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:31,980 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2024-11-27 23:25:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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 21 [2024-11-27 23:25:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:31,982 INFO L225 Difference]: With dead ends: 75 [2024-11-27 23:25:31,982 INFO L226 Difference]: Without dead ends: 50 [2024-11-27 23:25:31,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:31,983 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:25:31,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-27 23:25:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-27 23:25:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 42 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:25:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-27 23:25:31,997 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 21 [2024-11-27 23:25:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:31,997 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-27 23:25:31,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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) [2024-11-27 23:25:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-27 23:25:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-27 23:25:31,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:31,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:25:31,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:25:31,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:31,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1928498952, now seen corresponding path program 1 times [2024-11-27 23:25:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399532563] [2024-11-27 23:25:31,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 23:25:32,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:32,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399532563] [2024-11-27 23:25:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399532563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:32,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:25:32,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416186895] [2024-11-27 23:25:32,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:32,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:32,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:32,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,109 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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) [2024-11-27 23:25:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:32,131 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-11-27 23:25:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:32,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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 22 [2024-11-27 23:25:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:32,133 INFO L225 Difference]: With dead ends: 50 [2024-11-27 23:25:32,133 INFO L226 Difference]: Without dead ends: 49 [2024-11-27 23:25:32,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,134 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 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 [2024-11-27 23:25:32,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-27 23:25:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-27 23:25:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 41 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:25:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-27 23:25:32,149 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 22 [2024-11-27 23:25:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:32,149 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-27 23:25:32,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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) [2024-11-27 23:25:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-27 23:25:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 23:25:32,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:32,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:25:32,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:25:32,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:32,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash -331786717, now seen corresponding path program 1 times [2024-11-27 23:25:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:32,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966724180] [2024-11-27 23:25:32,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 23:25:32,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966724180] [2024-11-27 23:25:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966724180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:32,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:32,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:25:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629469551] [2024-11-27 23:25:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:32,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:32,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,250 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-27 23:25:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:32,298 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-11-27 23:25:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:32,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2024-11-27 23:25:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:32,299 INFO L225 Difference]: With dead ends: 84 [2024-11-27 23:25:32,300 INFO L226 Difference]: Without dead ends: 44 [2024-11-27 23:25:32,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,301 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 44 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 [2024-11-27 23:25:32,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-27 23:25:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-27 23:25:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.1875) internal successors, (38), 37 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:25:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-27 23:25:32,309 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2024-11-27 23:25:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:32,309 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-27 23:25:32,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-27 23:25:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-27 23:25:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 23:25:32,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:32,311 INFO L218 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] [2024-11-27 23:25:32,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:25:32,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:32,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1193549525, now seen corresponding path program 1 times [2024-11-27 23:25:32,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:32,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792449269] [2024-11-27 23:25:32,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 23:25:32,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792449269] [2024-11-27 23:25:32,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792449269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:32,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:32,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:25:32,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142757647] [2024-11-27 23:25:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:32,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:32,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:32,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,403 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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) [2024-11-27 23:25:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:32,422 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-27 23:25:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:32,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 29 [2024-11-27 23:25:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:32,424 INFO L225 Difference]: With dead ends: 44 [2024-11-27 23:25:32,424 INFO L226 Difference]: Without dead ends: 43 [2024-11-27 23:25:32,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,425 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 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 [2024-11-27 23:25:32,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-27 23:25:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-27 23:25:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:25:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-27 23:25:32,438 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 29 [2024-11-27 23:25:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:32,438 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-27 23:25:32,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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) [2024-11-27 23:25:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-27 23:25:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-27 23:25:32,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:32,445 INFO L218 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] [2024-11-27 23:25:32,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:25:32,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:32,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1654670499, now seen corresponding path program 1 times [2024-11-27 23:25:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950604115] [2024-11-27 23:25:32,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 23:25:32,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:32,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950604115] [2024-11-27 23:25:32,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950604115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:32,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:32,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:25:32,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773914459] [2024-11-27 23:25:32,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:32,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:32,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:32,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:32,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,540 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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) [2024-11-27 23:25:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:32,565 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-27 23:25:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:32,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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 30 [2024-11-27 23:25:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:32,566 INFO L225 Difference]: With dead ends: 43 [2024-11-27 23:25:32,567 INFO L226 Difference]: Without dead ends: 42 [2024-11-27 23:25:32,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,568 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 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 [2024-11-27 23:25:32,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-27 23:25:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-27 23:25:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:25:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-27 23:25:32,581 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 30 [2024-11-27 23:25:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:32,581 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-27 23:25:32,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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) [2024-11-27 23:25:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-27 23:25:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:25:32,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:32,587 INFO L218 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] [2024-11-27 23:25:32,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:25:32,587 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:32,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash 447056466, now seen corresponding path program 1 times [2024-11-27 23:25:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:32,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037520088] [2024-11-27 23:25:32,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 23:25:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037520088] [2024-11-27 23:25:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037520088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:32,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:25:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490138210] [2024-11-27 23:25:32,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:32,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:32,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:32,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:32,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,692 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-27 23:25:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:32,712 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-27 23:25:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:32,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 39 [2024-11-27 23:25:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:32,714 INFO L225 Difference]: With dead ends: 42 [2024-11-27 23:25:32,714 INFO L226 Difference]: Without dead ends: 41 [2024-11-27 23:25:32,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,715 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 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 [2024-11-27 23:25:32,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-27 23:25:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-27 23:25:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:25:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-27 23:25:32,730 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 39 [2024-11-27 23:25:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:32,730 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-27 23:25:32,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-27 23:25:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-27 23:25:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:25:32,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:32,734 INFO L218 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] [2024-11-27 23:25:32,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:25:32,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 23:25:32,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash 973848687, now seen corresponding path program 1 times [2024-11-27 23:25:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:32,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163145552] [2024-11-27 23:25:32,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:25:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:25:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 23:25:32,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:25:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163145552] [2024-11-27 23:25:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163145552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:25:32,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:25:32,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:25:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784167086] [2024-11-27 23:25:32,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:25:32,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:25:32,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:25:32,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:25:32,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,845 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-27 23:25:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:25:32,859 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-27 23:25:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:25:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-11-27 23:25:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:25:32,860 INFO L225 Difference]: With dead ends: 41 [2024-11-27 23:25:32,861 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 23:25:32,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:25:32,862 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:25:32,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:25:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 23:25:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 23:25:32,865 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) [2024-11-27 23:25:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 23:25:32,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-11-27 23:25:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:25:32,866 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 23:25:32,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-27 23:25:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 23:25:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 23:25:32,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-27 23:25:32,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-27 23:25:32,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-27 23:25:32,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-27 23:25:32,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-27 23:25:32,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-27 23:25:32,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-27 23:25:32,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-27 23:25:32,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:25:32,878 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:25:32,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-27 23:25:33,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:25:33,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:25:33 BoogieIcfgContainer [2024-11-27 23:25:33,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:25:33,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:25:33,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:25:33,015 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:25:33,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:30" (3/4) ... [2024-11-27 23:25:33,020 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 23:25:33,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-11-27 23:25:33,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-11-27 23:25:33,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-27 23:25:33,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-27 23:25:33,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-27 23:25:33,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 23:25:33,151 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:25:33,151 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:25:33,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:25:33,152 INFO L158 Benchmark]: Toolchain (without parser) took 4530.93ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 91.0MB in the beginning and 286.4MB in the end (delta: -195.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2024-11-27 23:25:33,152 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 142.6MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:25:33,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1506.13ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 82.4MB in the end (delta: 8.3MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2024-11-27 23:25:33,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.82ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 79.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:25:33,153 INFO L158 Benchmark]: Boogie Preprocessor took 53.29ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 77.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:25:33,154 INFO L158 Benchmark]: RCFGBuilder took 598.40ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 63.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:25:33,154 INFO L158 Benchmark]: TraceAbstraction took 2162.45ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 63.0MB in the beginning and 291.5MB in the end (delta: -228.5MB). Peak memory consumption was 337.5kB. Max. memory is 16.1GB. [2024-11-27 23:25:33,155 INFO L158 Benchmark]: Witness Printer took 136.01ms. Allocated memory is still 352.3MB. Free memory was 291.5MB in the beginning and 286.4MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:25:33,157 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 142.6MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1506.13ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 82.4MB in the end (delta: 8.3MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.82ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 79.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.29ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 77.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 598.40ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 63.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2162.45ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 63.0MB in the beginning and 291.5MB in the end (delta: -228.5MB). Peak memory consumption was 337.5kB. Max. memory is 16.1GB. * Witness Printer took 136.01ms. Allocated memory is still 352.3MB. Free memory was 291.5MB in the beginning and 286.4MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: 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, 59 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 905 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 380 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 525 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 64/64 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-27 23:25:33,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a5a2256-03c2-4bbf-b0ac-35ce946e0683/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE