./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 13:33:59,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 13:33:59,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 13:33:59,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 13:33:59,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 13:33:59,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 13:33:59,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 13:33:59,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 13:33:59,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 13:33:59,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 13:33:59,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 13:33:59,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 13:33:59,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 13:33:59,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 13:33:59,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 13:33:59,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 13:33:59,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 13:33:59,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 13:33:59,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 13:33:59,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 13:33:59,195 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 13:33:59,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 13:33:59,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 13:33:59,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 13:33:59,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 13:33:59,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 13:33:59,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 13:33:59,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 13:33:59,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 13:33:59,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 13:33:59,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 13:33:59,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 13:33:59,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 13:33:59,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 13:33:59,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 13:33:59,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 13:33:59,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 13:33:59,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 13:33:59,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 13:33:59,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 13:33:59,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 13:33:59,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 13:33:59,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-23 13:33:59,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 13:33:59,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 13:33:59,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 13:33:59,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 13:33:59,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 13:33:59,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 13:33:59,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 13:33:59,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 13:33:59,236 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 13:33:59,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 13:33:59,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 13:33:59,237 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 13:33:59,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 13:33:59,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 13:33:59,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 13:33:59,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 13:33:59,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 13:33:59,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 13:33:59,238 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-23 13:33:59,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 13:33:59,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 13:33:59,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 13:33:59,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 13:33:59,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 13:33:59,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 13:33:59,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 13:33:59,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:33:59,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 13:33:59,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 13:33:59,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 13:33:59,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 13:33:59,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 13:33:59,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 13:33:59,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2022-07-23 13:33:59,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 13:33:59,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 13:33:59,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 13:33:59,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 13:33:59,445 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 13:33:59,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2022-07-23 13:33:59,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9365b2d6/13ae221ab9a6449d8c79eb60ff500d53/FLAG386a36b5b [2022-07-23 13:33:59,871 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 13:33:59,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2022-07-23 13:33:59,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9365b2d6/13ae221ab9a6449d8c79eb60ff500d53/FLAG386a36b5b [2022-07-23 13:33:59,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9365b2d6/13ae221ab9a6449d8c79eb60ff500d53 [2022-07-23 13:33:59,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 13:33:59,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 13:33:59,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 13:33:59,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 13:33:59,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 13:33:59,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:33:59" (1/1) ... [2022-07-23 13:33:59,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dc8949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:33:59, skipping insertion in model container [2022-07-23 13:33:59,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:33:59" (1/1) ... [2022-07-23 13:33:59,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 13:33:59,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:34:00,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c[729,742] [2022-07-23 13:34:00,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:34:00,119 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 13:34:00,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c[729,742] [2022-07-23 13:34:00,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:34:00,173 INFO L208 MainTranslator]: Completed translation [2022-07-23 13:34:00,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00 WrapperNode [2022-07-23 13:34:00,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 13:34:00,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 13:34:00,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 13:34:00,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 13:34:00,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,230 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 229 [2022-07-23 13:34:00,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 13:34:00,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 13:34:00,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 13:34:00,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 13:34:00,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 13:34:00,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 13:34:00,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 13:34:00,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 13:34:00,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (1/1) ... [2022-07-23 13:34:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:34:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:00,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 13:34:00,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 13:34:00,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 13:34:00,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 13:34:00,355 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-23 13:34:00,358 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-23 13:34:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 13:34:00,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 13:34:00,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 13:34:00,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 13:34:00,414 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 13:34:00,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 13:34:00,720 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 13:34:00,726 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 13:34:00,726 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 13:34:00,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:00 BoogieIcfgContainer [2022-07-23 13:34:00,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 13:34:00,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 13:34:00,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 13:34:00,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 13:34:00,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 01:33:59" (1/3) ... [2022-07-23 13:34:00,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d062cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:34:00, skipping insertion in model container [2022-07-23 13:34:00,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:00" (2/3) ... [2022-07-23 13:34:00,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d062cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:34:00, skipping insertion in model container [2022-07-23 13:34:00,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:00" (3/3) ... [2022-07-23 13:34:00,756 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2022-07-23 13:34:00,768 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 13:34:00,768 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-23 13:34:00,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 13:34:00,837 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@516462a0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@57eff30c [2022-07-23 13:34:00,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-23 13:34:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 118 states have (on average 1.7966101694915255) internal successors, (212), 148 states have internal predecessors, (212), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-23 13:34:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 13:34:00,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:00,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:00,851 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:00,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:00,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2143107487, now seen corresponding path program 1 times [2022-07-23 13:34:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:00,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271245077] [2022-07-23 13:34:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:00,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271245077] [2022-07-23 13:34:00,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271245077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:00,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:00,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:34:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674639269] [2022-07-23 13:34:00,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:00,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 13:34:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:00,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 13:34:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 13:34:00,993 INFO L87 Difference]: Start difference. First operand has 158 states, 118 states have (on average 1.7966101694915255) internal successors, (212), 148 states have internal predecessors, (212), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:01,043 INFO L93 Difference]: Finished difference Result 311 states and 465 transitions. [2022-07-23 13:34:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 13:34:01,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 13:34:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:01,052 INFO L225 Difference]: With dead ends: 311 [2022-07-23 13:34:01,052 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 13:34:01,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 13:34:01,061 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:01,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:34:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 13:34:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-23 13:34:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.5842696629213484) internal successors, (141), 114 states have internal predecessors, (141), 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) [2022-07-23 13:34:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. [2022-07-23 13:34:01,103 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 153 transitions. Word has length 9 [2022-07-23 13:34:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:01,104 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 153 transitions. [2022-07-23 13:34:01,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2022-07-23 13:34:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 13:34:01,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:01,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:01,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 13:34:01,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2142166139, now seen corresponding path program 1 times [2022-07-23 13:34:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:01,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400670028] [2022-07-23 13:34:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:01,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:01,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400670028] [2022-07-23 13:34:01,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400670028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:01,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:01,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:34:01,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132464426] [2022-07-23 13:34:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:01,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:34:01,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:01,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:34:01,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:01,198 INFO L87 Difference]: Start difference. First operand 123 states and 153 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:01,309 INFO L93 Difference]: Finished difference Result 308 states and 394 transitions. [2022-07-23 13:34:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:34:01,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 13:34:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:01,312 INFO L225 Difference]: With dead ends: 308 [2022-07-23 13:34:01,313 INFO L226 Difference]: Without dead ends: 188 [2022-07-23 13:34:01,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:34:01,314 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 100 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:01,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 407 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-23 13:34:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2022-07-23 13:34:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.6058394160583942) internal successors, (220), 162 states have internal predecessors, (220), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 13:34:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2022-07-23 13:34:01,324 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 9 [2022-07-23 13:34:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:01,325 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2022-07-23 13:34:01,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2022-07-23 13:34:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 13:34:01,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:01,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:01,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 13:34:01,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 95711536, now seen corresponding path program 1 times [2022-07-23 13:34:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:01,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400883475] [2022-07-23 13:34:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:01,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400883475] [2022-07-23 13:34:01,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400883475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:01,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:01,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:34:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475478903] [2022-07-23 13:34:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:01,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:34:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:34:01,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:01,368 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:01,412 INFO L93 Difference]: Finished difference Result 319 states and 415 transitions. [2022-07-23 13:34:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:34:01,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 13:34:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:01,414 INFO L225 Difference]: With dead ends: 319 [2022-07-23 13:34:01,414 INFO L226 Difference]: Without dead ends: 152 [2022-07-23 13:34:01,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:34:01,415 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 33 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:01,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 417 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:34:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-23 13:34:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2022-07-23 13:34:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.588235294117647) internal successors, (162), 127 states have internal predecessors, (162), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 13:34:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 174 transitions. [2022-07-23 13:34:01,423 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 174 transitions. Word has length 12 [2022-07-23 13:34:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:01,423 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 174 transitions. [2022-07-23 13:34:01,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 174 transitions. [2022-07-23 13:34:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 13:34:01,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:01,424 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:01,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 13:34:01,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1515543675, now seen corresponding path program 1 times [2022-07-23 13:34:01,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:01,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792064904] [2022-07-23 13:34:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:01,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792064904] [2022-07-23 13:34:01,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792064904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:01,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652031741] [2022-07-23 13:34:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:01,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:01,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:01,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:01,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 13:34:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:01,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:34:01,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:01,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:01,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652031741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:01,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:01,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-23 13:34:01,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696746148] [2022-07-23 13:34:01,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:01,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:01,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 13:34:01,612 INFO L87 Difference]: Start difference. First operand 137 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 13:34:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:01,694 INFO L93 Difference]: Finished difference Result 210 states and 280 transitions. [2022-07-23 13:34:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:01,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-23 13:34:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:01,695 INFO L225 Difference]: With dead ends: 210 [2022-07-23 13:34:01,695 INFO L226 Difference]: Without dead ends: 206 [2022-07-23 13:34:01,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:34:01,696 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 219 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:01,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 392 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-23 13:34:01,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2022-07-23 13:34:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 151 states have (on average 1.609271523178808) internal successors, (243), 174 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 13:34:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 255 transitions. [2022-07-23 13:34:01,704 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 255 transitions. Word has length 16 [2022-07-23 13:34:01,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:01,705 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 255 transitions. [2022-07-23 13:34:01,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 13:34:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 255 transitions. [2022-07-23 13:34:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 13:34:01,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:01,706 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:01,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:01,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:01,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash -262786274, now seen corresponding path program 1 times [2022-07-23 13:34:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:01,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445572731] [2022-07-23 13:34:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 13:34:01,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:01,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445572731] [2022-07-23 13:34:01,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445572731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:01,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633061553] [2022-07-23 13:34:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:01,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:01,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:01,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:01,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 13:34:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:02,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 13:34:02,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 13:34:02,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:02,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633061553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:02,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:02,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-23 13:34:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052416564] [2022-07-23 13:34:02,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:02,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:34:02,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:02,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:34:02,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:02,045 INFO L87 Difference]: Start difference. First operand 185 states and 255 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 13:34:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:02,080 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2022-07-23 13:34:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:34:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-23 13:34:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:02,081 INFO L225 Difference]: With dead ends: 191 [2022-07-23 13:34:02,081 INFO L226 Difference]: Without dead ends: 190 [2022-07-23 13:34:02,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:02,083 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 3 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:02,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 269 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:34:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-23 13:34:02,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2022-07-23 13:34:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 151 states have (on average 1.596026490066225) internal successors, (241), 173 states have internal predecessors, (241), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 13:34:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 253 transitions. [2022-07-23 13:34:02,100 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 253 transitions. Word has length 17 [2022-07-23 13:34:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:02,101 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 253 transitions. [2022-07-23 13:34:02,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 13:34:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 253 transitions. [2022-07-23 13:34:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 13:34:02,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:02,102 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:02,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:02,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:02,324 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1331008227, now seen corresponding path program 1 times [2022-07-23 13:34:02,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:02,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557620264] [2022-07-23 13:34:02,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:02,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557620264] [2022-07-23 13:34:02,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557620264] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:02,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063563283] [2022-07-23 13:34:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:02,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:02,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 13:34:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:02,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:34:02,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:02,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:02,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063563283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:02,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:02,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-23 13:34:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498165637] [2022-07-23 13:34:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:02,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:02,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:02,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 13:34:02,460 INFO L87 Difference]: Start difference. First operand 184 states and 253 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 13:34:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:02,540 INFO L93 Difference]: Finished difference Result 231 states and 309 transitions. [2022-07-23 13:34:02,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:02,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-23 13:34:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:02,542 INFO L225 Difference]: With dead ends: 231 [2022-07-23 13:34:02,542 INFO L226 Difference]: Without dead ends: 226 [2022-07-23 13:34:02,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:34:02,542 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 203 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:02,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 415 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-23 13:34:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 204. [2022-07-23 13:34:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 171 states have (on average 1.567251461988304) internal successors, (268), 193 states have internal predecessors, (268), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 13:34:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 280 transitions. [2022-07-23 13:34:02,548 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 280 transitions. Word has length 18 [2022-07-23 13:34:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:02,549 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 280 transitions. [2022-07-23 13:34:02,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 13:34:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 280 transitions. [2022-07-23 13:34:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 13:34:02,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:02,550 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:02,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:02,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:02,768 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1686245072, now seen corresponding path program 1 times [2022-07-23 13:34:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:02,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336435135] [2022-07-23 13:34:02,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:02,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 13:34:02,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 13:34:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 13:34:02,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 13:34:02,798 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 13:34:02,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2022-07-23 13:34:02,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2022-07-23 13:34:02,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2022-07-23 13:34:02,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2022-07-23 13:34:02,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2022-07-23 13:34:02,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2022-07-23 13:34:02,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2022-07-23 13:34:02,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2022-07-23 13:34:02,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2022-07-23 13:34:02,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2022-07-23 13:34:02,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2022-07-23 13:34:02,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2022-07-23 13:34:02,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2022-07-23 13:34:02,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2022-07-23 13:34:02,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2022-07-23 13:34:02,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2022-07-23 13:34:02,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2022-07-23 13:34:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2022-07-23 13:34:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2022-07-23 13:34:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2022-07-23 13:34:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2022-07-23 13:34:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2022-07-23 13:34:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2022-07-23 13:34:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2022-07-23 13:34:02,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2022-07-23 13:34:02,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2022-07-23 13:34:02,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2022-07-23 13:34:02,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2022-07-23 13:34:02,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 13:34:02,825 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:02,827 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 13:34:02,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:34:02 BoogieIcfgContainer [2022-07-23 13:34:02,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 13:34:02,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 13:34:02,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 13:34:02,863 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 13:34:02,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:00" (3/4) ... [2022-07-23 13:34:02,865 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 13:34:02,865 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 13:34:02,865 INFO L158 Benchmark]: Toolchain (without parser) took 2968.51ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 88.6MB in the beginning and 92.2MB in the end (delta: -3.6MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2022-07-23 13:34:02,866 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:34:02,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.35ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 87.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 13:34:02,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.98ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 84.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 13:34:02,866 INFO L158 Benchmark]: Boogie Preprocessor took 31.05ms. Allocated memory is still 117.4MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 13:34:02,867 INFO L158 Benchmark]: RCFGBuilder took 464.59ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 60.4MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-23 13:34:02,867 INFO L158 Benchmark]: TraceAbstraction took 2110.72ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 92.4MB in the beginning and 93.3MB in the end (delta: -885.5kB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2022-07-23 13:34:02,867 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 174.1MB. Free memory was 93.3MB in the beginning and 92.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:34:02,868 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.35ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 87.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.98ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 84.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.05ms. Allocated memory is still 117.4MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.59ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 60.4MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2110.72ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 92.4MB in the beginning and 93.3MB in the end (delta: -885.5kB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 174.1MB. Free memory was 93.3MB in the beginning and 92.2MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=0, eb=0] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=0, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L251] zero = base2flt(0, 0) [L252] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=16777216, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=16777216, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=16777216, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=16777216, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=16777216, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=0, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=0, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777217, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777218, e=0, m=0, m = m & ~ (1U << 24U)=16777217, res = m | (unsigned int )((e + 128) << 24U)=16777218] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 158 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 558 mSDsluCounter, 2110 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1225 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 885 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 80 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 299 SizeOfPredicates, 2 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 9/12 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-23 13:34:02,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample