./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 20ed64ec 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_4-3a.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 63854123d7ab77bd9f32ab7eefa710cb72f6a12a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 11:27:28,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 11:27:28,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 11:27:28,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 11:27:28,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 11:27:28,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 11:27:28,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 11:27:28,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 11:27:28,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 11:27:28,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 11:27:28,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 11:27:28,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 11:27:28,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 11:27:28,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 11:27:28,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 11:27:28,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 11:27:28,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 11:27:28,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 11:27:28,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 11:27:28,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 11:27:28,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 11:27:28,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 11:27:28,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 11:27:28,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 11:27:28,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 11:27:28,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 11:27:28,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 11:27:28,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 11:27:28,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 11:27:28,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 11:27:28,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 11:27:28,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 11:27:28,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 11:27:28,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 11:27:28,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 11:27:28,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 11:27:28,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 11:27:28,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 11:27:28,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 11:27:28,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 11:27:28,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 11:27:28,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-08-27 11:27:28,371 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 11:27:28,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 11:27:28,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 11:27:28,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 11:27:28,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 11:27:28,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 11:27:28,374 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 11:27:28,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 11:27:28,374 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 11:27:28,374 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 11:27:28,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 11:27:28,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 11:27:28,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 11:27:28,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 11:27:28,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 11:27:28,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 11:27:28,375 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 11:27:28,376 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 11:27:28,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 11:27:28,376 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 11:27:28,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 11:27:28,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 11:27:28,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 11:27:28,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 11:27:28,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:27:28,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 11:27:28,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 11:27:28,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 11:27:28,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 11:27:28,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 11:27:28,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 11:27:28,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 11:27:28,378 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 -> 63854123d7ab77bd9f32ab7eefa710cb72f6a12a [2021-08-27 11:27:28,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 11:27:28,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 11:27:28,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 11:27:28,702 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 11:27:28,703 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 11:27:28,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2021-08-27 11:27:28,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea5eaed/10781fdef79443c595f811381d0abcb4/FLAG89fab2bab [2021-08-27 11:27:29,231 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 11:27:29,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2021-08-27 11:27:29,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea5eaed/10781fdef79443c595f811381d0abcb4/FLAG89fab2bab [2021-08-27 11:27:29,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea5eaed/10781fdef79443c595f811381d0abcb4 [2021-08-27 11:27:29,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 11:27:29,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 11:27:29,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 11:27:29,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 11:27:29,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 11:27:29,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d815e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29, skipping insertion in model container [2021-08-27 11:27:29,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 11:27:29,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 11:27:29,442 WARN L228 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_4-3a.c.cil.c[425,438] [2021-08-27 11:27:29,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:27:29,481 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 11:27:29,499 WARN L228 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_4-3a.c.cil.c[425,438] [2021-08-27 11:27:29,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:27:29,571 INFO L208 MainTranslator]: Completed translation [2021-08-27 11:27:29,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29 WrapperNode [2021-08-27 11:27:29,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 11:27:29,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 11:27:29,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 11:27:29,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 11:27:29,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 11:27:29,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 11:27:29,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 11:27:29,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 11:27:29,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 11:27:29,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 11:27:29,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 11:27:29,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 11:27:29,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (1/1) ... [2021-08-27 11:27:29,687 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:27:29,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:27:29,706 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) [2021-08-27 11:27:29,717 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 [2021-08-27 11:27:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 11:27:29,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 11:27:29,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 11:27:29,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 11:27:30,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 11:27:30,344 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-08-27 11:27:30,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:27:30 BoogieIcfgContainer [2021-08-27 11:27:30,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 11:27:30,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 11:27:30,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 11:27:30,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 11:27:30,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 11:27:29" (1/3) ... [2021-08-27 11:27:30,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c2f1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:27:30, skipping insertion in model container [2021-08-27 11:27:30,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:27:29" (2/3) ... [2021-08-27 11:27:30,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c2f1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:27:30, skipping insertion in model container [2021-08-27 11:27:30,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:27:30" (3/3) ... [2021-08-27 11:27:30,351 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2021-08-27 11:27:30,356 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 11:27:30,356 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-08-27 11:27:30,393 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 11:27:30,398 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 11:27:30,398 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-08-27 11:27:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 114 states have (on average 1.763157894736842) internal successors, (201), 152 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 11:27:30,419 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:30,420 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:30,420 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:30,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1807791520, now seen corresponding path program 1 times [2021-08-27 11:27:30,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:30,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878723027] [2021-08-27 11:27:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:30,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:30,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:30,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878723027] [2021-08-27 11:27:30,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878723027] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:30,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:30,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 11:27:30,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984356020] [2021-08-27 11:27:30,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 11:27:30,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:30,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 11:27:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:27:30,559 INFO L87 Difference]: Start difference. First operand has 153 states, 114 states have (on average 1.763157894736842) internal successors, (201), 152 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:30,583 INFO L93 Difference]: Finished difference Result 284 states and 374 transitions. [2021-08-27 11:27:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 11:27:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-08-27 11:27:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:30,592 INFO L225 Difference]: With dead ends: 284 [2021-08-27 11:27:30,592 INFO L226 Difference]: Without dead ends: 131 [2021-08-27 11:27:30,594 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:27:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-27 11:27:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-08-27 11:27:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.597938144329897) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2021-08-27 11:27:30,627 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 7 [2021-08-27 11:27:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:30,627 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2021-08-27 11:27:30,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2021-08-27 11:27:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 11:27:30,628 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:30,628 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:30,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 11:27:30,629 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1806850254, now seen corresponding path program 1 times [2021-08-27 11:27:30,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:30,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117977528] [2021-08-27 11:27:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:30,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:30,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:30,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117977528] [2021-08-27 11:27:30,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117977528] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:30,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:30,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 11:27:30,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917667113] [2021-08-27 11:27:30,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:27:30,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:27:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:27:30,681 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:30,815 INFO L93 Difference]: Finished difference Result 259 states and 304 transitions. [2021-08-27 11:27:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:27:30,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-08-27 11:27:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:30,817 INFO L225 Difference]: With dead ends: 259 [2021-08-27 11:27:30,817 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 11:27:30,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:27:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 11:27:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2021-08-27 11:27:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 142 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2021-08-27 11:27:30,828 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 7 [2021-08-27 11:27:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:30,828 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2021-08-27 11:27:30,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2021-08-27 11:27:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 11:27:30,829 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:30,829 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:30,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 11:27:30,830 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash -866677448, now seen corresponding path program 1 times [2021-08-27 11:27:30,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:30,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043918686] [2021-08-27 11:27:30,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:30,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:30,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:30,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043918686] [2021-08-27 11:27:30,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043918686] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:30,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:30,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:30,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328428708] [2021-08-27 11:27:30,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:30,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:30,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:30,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:30,882 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:31,044 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2021-08-27 11:27:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-27 11:27:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:31,046 INFO L225 Difference]: With dead ends: 220 [2021-08-27 11:27:31,047 INFO L226 Difference]: Without dead ends: 213 [2021-08-27 11:27:31,047 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:27:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-08-27 11:27:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 144. [2021-08-27 11:27:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 143 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2021-08-27 11:27:31,058 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 10 [2021-08-27 11:27:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:31,058 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2021-08-27 11:27:31,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2021-08-27 11:27:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 11:27:31,063 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:31,063 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:31,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 11:27:31,064 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1097196978, now seen corresponding path program 1 times [2021-08-27 11:27:31,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:31,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023770580] [2021-08-27 11:27:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:31,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:31,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:31,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023770580] [2021-08-27 11:27:31,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023770580] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:31,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:31,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 11:27:31,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531458556] [2021-08-27 11:27:31,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:27:31,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:27:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:27:31,115 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:31,245 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2021-08-27 11:27:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:27:31,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-27 11:27:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:31,250 INFO L225 Difference]: With dead ends: 212 [2021-08-27 11:27:31,250 INFO L226 Difference]: Without dead ends: 207 [2021-08-27 11:27:31,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:27:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-08-27 11:27:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 136. [2021-08-27 11:27:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.4594594594594594) internal successors, (162), 135 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2021-08-27 11:27:31,264 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 11 [2021-08-27 11:27:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:31,264 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2021-08-27 11:27:31,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2021-08-27 11:27:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 11:27:31,270 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:31,270 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:31,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 11:27:31,271 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:31,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:31,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1234080256, now seen corresponding path program 1 times [2021-08-27 11:27:31,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:31,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411065777] [2021-08-27 11:27:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:31,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:31,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:31,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411065777] [2021-08-27 11:27:31,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411065777] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:31,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:31,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:31,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174714627] [2021-08-27 11:27:31,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:31,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:31,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:31,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:31,347 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:31,465 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-08-27 11:27:31,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:31,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-27 11:27:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:31,467 INFO L225 Difference]: With dead ends: 208 [2021-08-27 11:27:31,467 INFO L226 Difference]: Without dead ends: 206 [2021-08-27 11:27:31,468 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:27:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-08-27 11:27:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 138. [2021-08-27 11:27:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 137 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2021-08-27 11:27:31,476 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 12 [2021-08-27 11:27:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:31,477 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2021-08-27 11:27:31,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2021-08-27 11:27:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 11:27:31,478 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:31,478 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:31,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 11:27:31,478 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:31,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1595344206, now seen corresponding path program 1 times [2021-08-27 11:27:31,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:31,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086989246] [2021-08-27 11:27:31,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:31,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:31,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:31,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086989246] [2021-08-27 11:27:31,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086989246] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:31,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:31,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:31,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910752943] [2021-08-27 11:27:31,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:31,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:31,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:31,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:31,531 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:31,643 INFO L93 Difference]: Finished difference Result 329 states and 382 transitions. [2021-08-27 11:27:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:31,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-27 11:27:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:31,645 INFO L225 Difference]: With dead ends: 329 [2021-08-27 11:27:31,645 INFO L226 Difference]: Without dead ends: 219 [2021-08-27 11:27:31,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-08-27 11:27:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 143. [2021-08-27 11:27:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 142 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2021-08-27 11:27:31,654 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 12 [2021-08-27 11:27:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:31,654 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2021-08-27 11:27:31,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2021-08-27 11:27:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 11:27:31,655 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:31,655 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:31,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 11:27:31,656 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:31,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2056836231, now seen corresponding path program 1 times [2021-08-27 11:27:31,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:31,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788847110] [2021-08-27 11:27:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:31,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:31,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:31,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788847110] [2021-08-27 11:27:31,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788847110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:31,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:31,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:31,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077259105] [2021-08-27 11:27:31,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:31,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:31,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:31,691 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:31,781 INFO L93 Difference]: Finished difference Result 217 states and 253 transitions. [2021-08-27 11:27:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:31,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-27 11:27:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:31,783 INFO L225 Difference]: With dead ends: 217 [2021-08-27 11:27:31,783 INFO L226 Difference]: Without dead ends: 215 [2021-08-27 11:27:31,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:27:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-27 11:27:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 146. [2021-08-27 11:27:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 145 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2021-08-27 11:27:31,791 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 13 [2021-08-27 11:27:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:31,791 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2021-08-27 11:27:31,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2021-08-27 11:27:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 11:27:31,794 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:31,794 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:31,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 11:27:31,794 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash 465285246, now seen corresponding path program 1 times [2021-08-27 11:27:31,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:31,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457138878] [2021-08-27 11:27:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:31,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:31,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:31,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457138878] [2021-08-27 11:27:31,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457138878] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:27:31,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008362343] [2021-08-27 11:27:31,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:31,856 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:27:31,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:27:31,861 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) [2021-08-27 11:27:31,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 11:27:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:31,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 11:27:31,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:27:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:32,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008362343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:32,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:27:32,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-08-27 11:27:32,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736770084] [2021-08-27 11:27:32,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:32,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:32,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:32,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:27:32,028 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:32,114 INFO L93 Difference]: Finished difference Result 281 states and 324 transitions. [2021-08-27 11:27:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:32,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-27 11:27:32,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:32,116 INFO L225 Difference]: With dead ends: 281 [2021-08-27 11:27:32,116 INFO L226 Difference]: Without dead ends: 278 [2021-08-27 11:27:32,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:27:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-27 11:27:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 133. [2021-08-27 11:27:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.407079646017699) internal successors, (159), 132 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2021-08-27 11:27:32,124 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 13 [2021-08-27 11:27:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:32,125 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2021-08-27 11:27:32,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2021-08-27 11:27:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 11:27:32,129 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:32,129 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:32,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 11:27:32,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:27:32,341 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:32,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash -793504392, now seen corresponding path program 1 times [2021-08-27 11:27:32,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:32,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283958037] [2021-08-27 11:27:32,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:32,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:32,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:32,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283958037] [2021-08-27 11:27:32,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283958037] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:32,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:32,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:32,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477418775] [2021-08-27 11:27:32,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:32,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:32,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:32,451 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:32,645 INFO L93 Difference]: Finished difference Result 293 states and 344 transitions. [2021-08-27 11:27:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 11:27:32,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-27 11:27:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:32,646 INFO L225 Difference]: With dead ends: 293 [2021-08-27 11:27:32,646 INFO L226 Difference]: Without dead ends: 219 [2021-08-27 11:27:32,647 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 90.0ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 11:27:32,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-08-27 11:27:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 177. [2021-08-27 11:27:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.375796178343949) internal successors, (216), 176 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 216 transitions. [2021-08-27 11:27:32,656 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 216 transitions. Word has length 15 [2021-08-27 11:27:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:32,657 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 216 transitions. [2021-08-27 11:27:32,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 216 transitions. [2021-08-27 11:27:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 11:27:32,658 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:32,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:32,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 11:27:32,659 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash -47207071, now seen corresponding path program 1 times [2021-08-27 11:27:32,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:32,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626214547] [2021-08-27 11:27:32,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:32,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:32,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:32,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626214547] [2021-08-27 11:27:32,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626214547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:32,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:32,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:32,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328200711] [2021-08-27 11:27:32,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:32,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:32,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:32,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:32,719 INFO L87 Difference]: Start difference. First operand 177 states and 216 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:32,795 INFO L93 Difference]: Finished difference Result 284 states and 338 transitions. [2021-08-27 11:27:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:32,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-27 11:27:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:32,797 INFO L225 Difference]: With dead ends: 284 [2021-08-27 11:27:32,797 INFO L226 Difference]: Without dead ends: 282 [2021-08-27 11:27:32,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:27:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-08-27 11:27:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 182. [2021-08-27 11:27:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 181 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 220 transitions. [2021-08-27 11:27:32,808 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 220 transitions. Word has length 15 [2021-08-27 11:27:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:32,808 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 220 transitions. [2021-08-27 11:27:32,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 220 transitions. [2021-08-27 11:27:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 11:27:32,809 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:32,809 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:32,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 11:27:32,809 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:32,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1418335763, now seen corresponding path program 1 times [2021-08-27 11:27:32,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:32,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949509070] [2021-08-27 11:27:32,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:32,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:32,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:32,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949509070] [2021-08-27 11:27:32,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949509070] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:32,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:32,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:27:32,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202146777] [2021-08-27 11:27:32,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:27:32,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:27:32,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:32,859 INFO L87 Difference]: Start difference. First operand 182 states and 220 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:32,942 INFO L93 Difference]: Finished difference Result 373 states and 439 transitions. [2021-08-27 11:27:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:27:32,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-27 11:27:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:32,944 INFO L225 Difference]: With dead ends: 373 [2021-08-27 11:27:32,944 INFO L226 Difference]: Without dead ends: 370 [2021-08-27 11:27:32,944 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:27:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-27 11:27:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 167. [2021-08-27 11:27:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 166 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2021-08-27 11:27:32,964 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 15 [2021-08-27 11:27:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:32,964 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2021-08-27 11:27:32,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2021-08-27 11:27:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 11:27:32,965 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:32,965 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:32,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 11:27:32,969 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1101296279, now seen corresponding path program 1 times [2021-08-27 11:27:32,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:32,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722568773] [2021-08-27 11:27:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:32,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:33,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:33,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722568773] [2021-08-27 11:27:33,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722568773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:33,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:33,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 11:27:33,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063402508] [2021-08-27 11:27:33,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:27:33,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:27:33,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:27:33,110 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:33,277 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2021-08-27 11:27:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:27:33,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-27 11:27:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:33,280 INFO L225 Difference]: With dead ends: 286 [2021-08-27 11:27:33,280 INFO L226 Difference]: Without dead ends: 285 [2021-08-27 11:27:33,281 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:27:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-08-27 11:27:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 183. [2021-08-27 11:27:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 182 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 223 transitions. [2021-08-27 11:27:33,294 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 223 transitions. Word has length 21 [2021-08-27 11:27:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:33,295 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 223 transitions. [2021-08-27 11:27:33,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 223 transitions. [2021-08-27 11:27:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:33,295 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:33,296 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:33,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 11:27:33,297 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:33,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1783760243, now seen corresponding path program 1 times [2021-08-27 11:27:33,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:33,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70128927] [2021-08-27 11:27:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:33,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:33,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:33,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70128927] [2021-08-27 11:27:33,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70128927] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:33,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:33,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:33,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431227650] [2021-08-27 11:27:33,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 11:27:33,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:33,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 11:27:33,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:27:33,496 INFO L87 Difference]: Start difference. First operand 183 states and 223 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:33,892 INFO L93 Difference]: Finished difference Result 338 states and 391 transitions. [2021-08-27 11:27:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 11:27:33,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-27 11:27:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:33,894 INFO L225 Difference]: With dead ends: 338 [2021-08-27 11:27:33,894 INFO L226 Difference]: Without dead ends: 335 [2021-08-27 11:27:33,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 119.5ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-08-27 11:27:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-08-27 11:27:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 209. [2021-08-27 11:27:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 193 states have (on average 1.3212435233160622) internal successors, (255), 208 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 255 transitions. [2021-08-27 11:27:33,906 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 255 transitions. Word has length 23 [2021-08-27 11:27:33,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:33,906 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 255 transitions. [2021-08-27 11:27:33,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 255 transitions. [2021-08-27 11:27:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:33,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:33,908 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:33,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 11:27:33,908 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:33,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash 685438419, now seen corresponding path program 1 times [2021-08-27 11:27:33,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:33,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878551738] [2021-08-27 11:27:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:33,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:33,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:33,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878551738] [2021-08-27 11:27:33,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878551738] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:33,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:33,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:33,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193298978] [2021-08-27 11:27:33,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:33,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:33,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:33,996 INFO L87 Difference]: Start difference. First operand 209 states and 255 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:34,084 INFO L93 Difference]: Finished difference Result 249 states and 289 transitions. [2021-08-27 11:27:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:27:34,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-27 11:27:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:34,085 INFO L225 Difference]: With dead ends: 249 [2021-08-27 11:27:34,086 INFO L226 Difference]: Without dead ends: 181 [2021-08-27 11:27:34,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:27:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-27 11:27:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2021-08-27 11:27:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 132 states have (on average 1.356060606060606) internal successors, (179), 147 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2021-08-27 11:27:34,094 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 23 [2021-08-27 11:27:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:34,094 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2021-08-27 11:27:34,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2021-08-27 11:27:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:34,095 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:34,095 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:34,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 11:27:34,096 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1210324973, now seen corresponding path program 1 times [2021-08-27 11:27:34,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:34,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708233096] [2021-08-27 11:27:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:34,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:34,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:34,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708233096] [2021-08-27 11:27:34,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708233096] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:34,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:34,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:34,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280279291] [2021-08-27 11:27:34,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:34,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:34,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:34,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:34,147 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:34,255 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-08-27 11:27:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 11:27:34,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-27 11:27:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:34,256 INFO L225 Difference]: With dead ends: 208 [2021-08-27 11:27:34,257 INFO L226 Difference]: Without dead ends: 180 [2021-08-27 11:27:34,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:27:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-27 11:27:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 154. [2021-08-27 11:27:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 153 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2021-08-27 11:27:34,266 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 23 [2021-08-27 11:27:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:34,266 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2021-08-27 11:27:34,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2021-08-27 11:27:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:34,267 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:34,267 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:34,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 11:27:34,268 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash -322402664, now seen corresponding path program 1 times [2021-08-27 11:27:34,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:34,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862872390] [2021-08-27 11:27:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:34,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:34,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:34,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862872390] [2021-08-27 11:27:34,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862872390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:34,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:34,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:27:34,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5024181] [2021-08-27 11:27:34,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:34,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:34,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:34,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:34,362 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:34,515 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2021-08-27 11:27:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 11:27:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-27 11:27:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:34,517 INFO L225 Difference]: With dead ends: 261 [2021-08-27 11:27:34,517 INFO L226 Difference]: Without dead ends: 229 [2021-08-27 11:27:34,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:27:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-08-27 11:27:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 157. [2021-08-27 11:27:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 156 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 188 transitions. [2021-08-27 11:27:34,526 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 188 transitions. Word has length 23 [2021-08-27 11:27:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:34,527 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 188 transitions. [2021-08-27 11:27:34,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 188 transitions. [2021-08-27 11:27:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:27:34,527 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:34,528 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:34,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 11:27:34,528 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -322343082, now seen corresponding path program 1 times [2021-08-27 11:27:34,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:34,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701460947] [2021-08-27 11:27:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:34,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:34,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:34,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701460947] [2021-08-27 11:27:34,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701460947] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:34,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:34,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:27:34,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366654492] [2021-08-27 11:27:34,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:34,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:34,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:34,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:34,625 INFO L87 Difference]: Start difference. First operand 157 states and 188 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:34,825 INFO L93 Difference]: Finished difference Result 425 states and 485 transitions. [2021-08-27 11:27:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 11:27:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-27 11:27:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:34,827 INFO L225 Difference]: With dead ends: 425 [2021-08-27 11:27:34,827 INFO L226 Difference]: Without dead ends: 424 [2021-08-27 11:27:34,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 98.2ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:27:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-08-27 11:27:34,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 183. [2021-08-27 11:27:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 167 states have (on average 1.3293413173652695) internal successors, (222), 182 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 222 transitions. [2021-08-27 11:27:34,839 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 222 transitions. Word has length 23 [2021-08-27 11:27:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:34,839 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 222 transitions. [2021-08-27 11:27:34,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 222 transitions. [2021-08-27 11:27:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 11:27:34,840 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:34,840 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:34,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 11:27:34,841 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:34,841 INFO L82 PathProgramCache]: Analyzing trace with hash -756568499, now seen corresponding path program 1 times [2021-08-27 11:27:34,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:34,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659008255] [2021-08-27 11:27:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:34,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:34,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:34,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659008255] [2021-08-27 11:27:34,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659008255] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:34,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:34,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:27:34,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352802546] [2021-08-27 11:27:34,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:34,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:34,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:34,926 INFO L87 Difference]: Start difference. First operand 183 states and 222 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:35,176 INFO L93 Difference]: Finished difference Result 465 states and 521 transitions. [2021-08-27 11:27:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 11:27:35,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-27 11:27:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:35,178 INFO L225 Difference]: With dead ends: 465 [2021-08-27 11:27:35,178 INFO L226 Difference]: Without dead ends: 464 [2021-08-27 11:27:35,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 102.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-08-27 11:27:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-27 11:27:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 239. [2021-08-27 11:27:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 223 states have (on average 1.3318385650224216) internal successors, (297), 238 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 297 transitions. [2021-08-27 11:27:35,195 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 297 transitions. Word has length 25 [2021-08-27 11:27:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:35,196 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 297 transitions. [2021-08-27 11:27:35,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 297 transitions. [2021-08-27 11:27:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 11:27:35,196 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:35,196 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:35,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 11:27:35,197 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:35,197 INFO L82 PathProgramCache]: Analyzing trace with hash -591306022, now seen corresponding path program 1 times [2021-08-27 11:27:35,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:35,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965819056] [2021-08-27 11:27:35,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:35,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:35,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:35,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965819056] [2021-08-27 11:27:35,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965819056] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:35,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:35,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:35,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129346872] [2021-08-27 11:27:35,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 11:27:35,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 11:27:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:27:35,314 INFO L87 Difference]: Start difference. First operand 239 states and 297 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:35,679 INFO L93 Difference]: Finished difference Result 498 states and 555 transitions. [2021-08-27 11:27:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 11:27:35,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-27 11:27:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:35,681 INFO L225 Difference]: With dead ends: 498 [2021-08-27 11:27:35,682 INFO L226 Difference]: Without dead ends: 431 [2021-08-27 11:27:35,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 144.4ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-08-27 11:27:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-08-27 11:27:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 236. [2021-08-27 11:27:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 235 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 290 transitions. [2021-08-27 11:27:35,697 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 290 transitions. Word has length 25 [2021-08-27 11:27:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:35,697 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 290 transitions. [2021-08-27 11:27:35,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 290 transitions. [2021-08-27 11:27:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 11:27:35,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:35,698 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:35,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 11:27:35,698 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1716642380, now seen corresponding path program 1 times [2021-08-27 11:27:35,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:35,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647548001] [2021-08-27 11:27:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:35,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:35,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:35,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647548001] [2021-08-27 11:27:35,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647548001] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:35,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:35,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:35,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729486271] [2021-08-27 11:27:35,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 11:27:35,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 11:27:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:27:35,856 INFO L87 Difference]: Start difference. First operand 236 states and 290 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:36,186 INFO L93 Difference]: Finished difference Result 320 states and 381 transitions. [2021-08-27 11:27:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:27:36,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-27 11:27:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:36,190 INFO L225 Difference]: With dead ends: 320 [2021-08-27 11:27:36,190 INFO L226 Difference]: Without dead ends: 319 [2021-08-27 11:27:36,191 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 173.6ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:27:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-08-27 11:27:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 236. [2021-08-27 11:27:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 220 states have (on average 1.3136363636363637) internal successors, (289), 235 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 289 transitions. [2021-08-27 11:27:36,208 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 289 transitions. Word has length 25 [2021-08-27 11:27:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:36,208 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 289 transitions. [2021-08-27 11:27:36,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 289 transitions. [2021-08-27 11:27:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 11:27:36,209 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:36,209 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:36,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 11:27:36,210 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1212842863, now seen corresponding path program 1 times [2021-08-27 11:27:36,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:36,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589365449] [2021-08-27 11:27:36,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:36,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:27:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:27:36,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:27:36,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589365449] [2021-08-27 11:27:36,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589365449] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:27:36,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:27:36,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:27:36,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853801680] [2021-08-27 11:27:36,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:27:36,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:27:36,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:27:36,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:27:36,290 INFO L87 Difference]: Start difference. First operand 236 states and 289 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:27:36,378 INFO L93 Difference]: Finished difference Result 264 states and 317 transitions. [2021-08-27 11:27:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:27:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-27 11:27:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:27:36,380 INFO L225 Difference]: With dead ends: 264 [2021-08-27 11:27:36,380 INFO L226 Difference]: Without dead ends: 218 [2021-08-27 11:27:36,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:27:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-08-27 11:27:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2021-08-27 11:27:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 200 states have (on average 1.325) internal successors, (265), 215 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 265 transitions. [2021-08-27 11:27:36,393 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 265 transitions. Word has length 27 [2021-08-27 11:27:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:27:36,394 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 265 transitions. [2021-08-27 11:27:36,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:27:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2021-08-27 11:27:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 11:27:36,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:27:36,395 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:27:36,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 11:27:36,395 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:27:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:27:36,396 INFO L82 PathProgramCache]: Analyzing trace with hash 350457026, now seen corresponding path program 1 times [2021-08-27 11:27:36,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:27:36,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976076052] [2021-08-27 11:27:36,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:27:36,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:27:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:27:36,407 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 11:27:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:27:36,438 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 11:27:36,441 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 11:27:36,442 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:27:36,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 11:27:36,458 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 11:27:36,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 11:27:36 BoogieIcfgContainer [2021-08-27 11:27:36,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 11:27:36,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 11:27:36,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 11:27:36,513 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 11:27:36,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:27:30" (3/4) ... [2021-08-27 11:27:36,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 11:27:36,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 11:27:36,518 INFO L168 Benchmark]: Toolchain (without parser) took 7249.69 ms. Allocated memory was 54.5 MB in the beginning and 180.4 MB in the end (delta: 125.8 MB). Free memory was 31.3 MB in the beginning and 62.7 MB in the end (delta: -31.4 MB). Peak memory consumption was 94.0 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:36,518 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 37.0 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:27:36,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.93 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 31.1 MB in the beginning and 51.0 MB in the end (delta: -19.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:36,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.74 ms. Allocated memory is still 69.2 MB. Free memory was 51.0 MB in the beginning and 48.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:36,520 INFO L168 Benchmark]: Boogie Preprocessor took 51.04 ms. Allocated memory is still 69.2 MB. Free memory was 48.4 MB in the beginning and 46.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:36,520 INFO L168 Benchmark]: RCFGBuilder took 668.08 ms. Allocated memory is still 69.2 MB. Free memory was 46.5 MB in the beginning and 39.6 MB in the end (delta: 6.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:36,520 INFO L168 Benchmark]: TraceAbstraction took 6164.53 ms. Allocated memory was 69.2 MB in the beginning and 180.4 MB in the end (delta: 111.1 MB). Free memory was 39.3 MB in the beginning and 62.7 MB in the end (delta: -23.3 MB). Peak memory consumption was 87.8 MB. Max. memory is 16.1 GB. [2021-08-27 11:27:36,520 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 180.4 MB. Free memory is still 62.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:27:36,523 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.19 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 37.0 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 301.93 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 31.1 MB in the beginning and 51.0 MB in the end (delta: -19.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.74 ms. Allocated memory is still 69.2 MB. Free memory was 51.0 MB in the beginning and 48.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.04 ms. Allocated memory is still 69.2 MB. Free memory was 48.4 MB in the beginning and 46.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 668.08 ms. Allocated memory is still 69.2 MB. Free memory was 46.5 MB in the beginning and 39.6 MB in the end (delta: 6.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6164.53 ms. Allocated memory was 69.2 MB in the beginning and 180.4 MB in the end (delta: 111.1 MB). Free memory was 39.3 MB in the beginning and 62.7 MB in the end (delta: -23.3 MB). Peak memory consumption was 87.8 MB. Max. memory is 16.1 GB. * Witness Printer took 4.14 ms. Allocated memory is still 180.4 MB. Free memory is still 62.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 102, overapproximation of bitwiseAnd at line 103. Possible FailurePath: [L218] unsigned int a ; [L219] unsigned int ma = __VERIFIER_nondet_uint(); [L220] signed char ea = __VERIFIER_nondet_char(); [L221] unsigned int b ; [L222] unsigned int mb = __VERIFIER_nondet_uint(); [L223] signed char eb = __VERIFIER_nondet_char(); [L224] unsigned int r_add1 ; [L225] unsigned int r_add2 ; [L226] unsigned int zero ; [L227] int tmp ; [L228] int tmp___0 ; [L229] int __retres14 ; [L17] unsigned int res ; [L18] unsigned int __retres4 ; [L21] COND TRUE ! m [L22] __retres4 = 0U [L72] return (__retres4); [L233] zero = base2flt(0, 0) [L17] unsigned int res ; [L18] unsigned int __retres4 ; [L21] COND FALSE !(! m) [L27] COND FALSE !(m < 1U << 24U) [L49] COND TRUE 1 [L51] COND TRUE m >= 1U << 25U [L56] COND TRUE e >= 127 [L57] __retres4 = 4294967295U [L72] return (__retres4); [L234] a = base2flt(ma, ea) [L17] unsigned int res ; [L18] unsigned int __retres4 ; [L21] COND FALSE !(! m) [L27] COND FALSE !(m < 1U << 24U) [L49] COND TRUE 1 [L51] COND FALSE !(m >= 1U << 25U) [L68] m = m & ~ (1U << 24U) [L69] EXPR e + 128 [L69] res = m | ((unsigned int )(e + 128) << 24U) [L70] __retres4 = res [L72] return (__retres4); [L235] b = base2flt(mb, eb) [L76] unsigned int res ; [L77] unsigned int ma ; [L78] unsigned int mb ; [L79] unsigned int delta ; [L80] int ea ; [L81] int eb ; [L82] unsigned int tmp ; [L83] unsigned int __retres10 ; [L86] COND FALSE !(a < b) [L93] COND FALSE !(! b) [L100] ma = a & ((1U << 24U) - 1U) [L101] EXPR (int )(a >> 24U) - 128 [L101] ea = (int )(a >> 24U) - 128 [L102] ma = ma | (1U << 24U) [L103] mb = b & ((1U << 24U) - 1U) [L104] (int )(b >> 24U) - 128 - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: 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: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 6065.4ms, OverallIterations: 22, TraceHistogramMax: 2, EmptinessCheckTime: 31.8ms, AutomataDifference: 3469.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3487 SDtfs, 4697 SDslu, 8461 SDs, 0 SdLazy, 1940 SolverSat, 255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1747.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1087.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=18, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 245.6ms AutomataMinimizationTime, 21 MinimizatonAttempts, 1950 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.5ms SsaConstructionTime, 263.4ms SatisfiabilityAnalysisTime, 1428.5ms InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 1469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 66 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 2/4 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 [2021-08-27 11:27:36,547 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...