./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/s3_srvr_1a_alt.BV.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 00d015cea7b11aabc3ddec4842024b6b03cb0eb9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1.24-f6fb2bb [2019-11-19 19:53:39,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:53:39,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:53:39,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:53:39,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:53:39,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:53:39,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:53:39,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:53:39,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:53:39,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:53:39,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:53:39,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:53:39,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:53:39,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:53:39,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:53:39,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:53:39,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:53:39,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:53:39,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:53:39,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:53:39,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:53:39,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:53:39,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:53:39,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:53:39,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:53:39,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:53:39,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:53:39,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:53:39,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:53:39,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:53:39,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:53:39,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:53:39,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:53:39,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:53:39,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:53:39,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:53:39,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:53:39,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:53:39,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:53:39,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:53:39,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:53:39,419 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-19 19:53:39,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:53:39,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:53:39,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:53:39,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:53:39,442 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:53:39,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:53:39,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 19:53:39,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:53:39,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:53:39,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 19:53:39,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:53:39,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 19:53:39,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 19:53:39,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 19:53:39,445 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 19:53:39,446 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 19:53:39,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:53:39,446 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:53:39,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 19:53:39,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:53:39,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:53:39,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 19:53:39,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 19:53:39,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:53:39,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:53:39,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 19:53:39,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 19:53:39,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:53:39,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 19:53:39,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 19:53:39,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 00d015cea7b11aabc3ddec4842024b6b03cb0eb9 [2019-11-19 19:53:39,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:53:39,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:53:39,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:53:39,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:53:39,764 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:53:39,765 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a_alt.BV.c.cil.c [2019-11-19 19:53:39,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93f283af/bb9343aca37f454295352ea02230a11c/FLAG611cab41e [2019-11-19 19:53:40,243 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:53:40,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a_alt.BV.c.cil.c [2019-11-19 19:53:40,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93f283af/bb9343aca37f454295352ea02230a11c/FLAG611cab41e [2019-11-19 19:53:40,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93f283af/bb9343aca37f454295352ea02230a11c [2019-11-19 19:53:40,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:53:40,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:53:40,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:53:40,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:53:40,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:53:40,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:40" (1/1) ... [2019-11-19 19:53:40,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb1b32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:40, skipping insertion in model container [2019-11-19 19:53:40,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:40" (1/1) ... [2019-11-19 19:53:40,611 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:53:40,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:53:40,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:53:40,911 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:53:41,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:53:41,058 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:53:41,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41 WrapperNode [2019-11-19 19:53:41,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:53:41,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:53:41,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:53:41,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:53:41,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:53:41,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:53:41,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:53:41,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:53:41,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... [2019-11-19 19:53:41,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:53:41,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:53:41,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:53:41,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:53:41,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:53:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:53:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:53:41,539 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 19:53:42,147 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-19 19:53:42,148 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-19 19:53:42,150 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:53:42,151 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 19:53:42,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:42 BoogieIcfgContainer [2019-11-19 19:53:42,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:53:42,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 19:53:42,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 19:53:42,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 19:53:42,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:40" (1/3) ... [2019-11-19 19:53:42,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349b2ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:42, skipping insertion in model container [2019-11-19 19:53:42,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:41" (2/3) ... [2019-11-19 19:53:42,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349b2ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:42, skipping insertion in model container [2019-11-19 19:53:42,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:42" (3/3) ... [2019-11-19 19:53:42,164 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_alt.BV.c.cil.c [2019-11-19 19:53:42,175 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 19:53:42,185 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-11-19 19:53:42,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-19 19:53:42,241 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 19:53:42,241 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 19:53:42,244 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 19:53:42,244 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:53:42,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:53:42,245 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 19:53:42,245 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:53:42,245 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 19:53:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-11-19 19:53:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 19:53:42,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:42,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:42,277 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:42,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-11-19 19:53:42,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:42,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924223494] [2019-11-19 19:53:42,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:42,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924223494] [2019-11-19 19:53:42,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:42,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:42,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051538281] [2019-11-19 19:53:42,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:42,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:42,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:42,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:42,588 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2019-11-19 19:53:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:42,846 INFO L93 Difference]: Finished difference Result 343 states and 551 transitions. [2019-11-19 19:53:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:42,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 19:53:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:42,863 INFO L225 Difference]: With dead ends: 343 [2019-11-19 19:53:42,864 INFO L226 Difference]: Without dead ends: 168 [2019-11-19 19:53:42,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-19 19:53:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-11-19 19:53:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 19:53:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2019-11-19 19:53:42,930 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 243 transitions. Word has length 17 [2019-11-19 19:53:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:42,931 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-11-19 19:53:42,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 243 transitions. [2019-11-19 19:53:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 19:53:42,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:42,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:42,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:42,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-11-19 19:53:42,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:42,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734244483] [2019-11-19 19:53:42,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:42,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734244483] [2019-11-19 19:53:42,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:42,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:42,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172925948] [2019-11-19 19:53:42,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:42,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:42,988 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. Second operand 3 states. [2019-11-19 19:53:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:43,179 INFO L93 Difference]: Finished difference Result 339 states and 488 transitions. [2019-11-19 19:53:43,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:43,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-19 19:53:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:43,181 INFO L225 Difference]: With dead ends: 339 [2019-11-19 19:53:43,182 INFO L226 Difference]: Without dead ends: 178 [2019-11-19 19:53:43,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-19 19:53:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2019-11-19 19:53:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-19 19:53:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2019-11-19 19:53:43,209 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 18 [2019-11-19 19:53:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:43,211 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2019-11-19 19:53:43,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2019-11-19 19:53:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 19:53:43,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:43,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:43,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:43,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:43,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-11-19 19:53:43,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:43,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534591010] [2019-11-19 19:53:43,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:43,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534591010] [2019-11-19 19:53:43,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:43,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:43,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973188065] [2019-11-19 19:53:43,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:43,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:43,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:43,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:43,308 INFO L87 Difference]: Start difference. First operand 169 states and 244 transitions. Second operand 3 states. [2019-11-19 19:53:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:43,474 INFO L93 Difference]: Finished difference Result 341 states and 490 transitions. [2019-11-19 19:53:43,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:43,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 19:53:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:43,478 INFO L225 Difference]: With dead ends: 341 [2019-11-19 19:53:43,478 INFO L226 Difference]: Without dead ends: 179 [2019-11-19 19:53:43,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:43,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-19 19:53:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 170. [2019-11-19 19:53:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-19 19:53:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2019-11-19 19:53:43,503 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 19 [2019-11-19 19:53:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:43,503 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2019-11-19 19:53:43,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2019-11-19 19:53:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 19:53:43,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:43,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:43,505 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:43,506 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-11-19 19:53:43,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:43,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306739269] [2019-11-19 19:53:43,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:43,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306739269] [2019-11-19 19:53:43,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:43,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:43,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846769486] [2019-11-19 19:53:43,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:43,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:43,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:43,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:43,550 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand 3 states. [2019-11-19 19:53:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:43,706 INFO L93 Difference]: Finished difference Result 343 states and 492 transitions. [2019-11-19 19:53:43,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:43,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 19:53:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:43,708 INFO L225 Difference]: With dead ends: 343 [2019-11-19 19:53:43,708 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 19:53:43,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 19:53:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2019-11-19 19:53:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-19 19:53:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2019-11-19 19:53:43,723 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 20 [2019-11-19 19:53:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:43,724 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2019-11-19 19:53:43,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2019-11-19 19:53:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 19:53:43,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:43,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:43,726 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-11-19 19:53:43,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:43,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108815996] [2019-11-19 19:53:43,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:43,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108815996] [2019-11-19 19:53:43,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:43,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:43,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825379383] [2019-11-19 19:53:43,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:43,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:43,765 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand 3 states. [2019-11-19 19:53:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:43,915 INFO L93 Difference]: Finished difference Result 345 states and 494 transitions. [2019-11-19 19:53:43,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:43,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 19:53:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:43,917 INFO L225 Difference]: With dead ends: 345 [2019-11-19 19:53:43,917 INFO L226 Difference]: Without dead ends: 181 [2019-11-19 19:53:43,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-19 19:53:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2019-11-19 19:53:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-19 19:53:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 247 transitions. [2019-11-19 19:53:43,943 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 247 transitions. Word has length 21 [2019-11-19 19:53:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:43,944 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 247 transitions. [2019-11-19 19:53:43,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 247 transitions. [2019-11-19 19:53:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 19:53:43,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:43,949 INFO L410 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, 1, 1, 1, 1, 1] [2019-11-19 19:53:43,950 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -853626144, now seen corresponding path program 1 times [2019-11-19 19:53:43,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:43,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981750068] [2019-11-19 19:53:43,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:44,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981750068] [2019-11-19 19:53:44,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:44,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:44,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651292629] [2019-11-19 19:53:44,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:44,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:44,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:44,041 INFO L87 Difference]: Start difference. First operand 172 states and 247 transitions. Second operand 3 states. [2019-11-19 19:53:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:44,188 INFO L93 Difference]: Finished difference Result 378 states and 548 transitions. [2019-11-19 19:53:44,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:44,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-19 19:53:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:44,190 INFO L225 Difference]: With dead ends: 378 [2019-11-19 19:53:44,190 INFO L226 Difference]: Without dead ends: 213 [2019-11-19 19:53:44,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-19 19:53:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 197. [2019-11-19 19:53:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-19 19:53:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2019-11-19 19:53:44,200 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 32 [2019-11-19 19:53:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:44,201 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2019-11-19 19:53:44,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2019-11-19 19:53:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 19:53:44,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:44,203 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:44,203 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash 689633844, now seen corresponding path program 1 times [2019-11-19 19:53:44,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:44,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242243320] [2019-11-19 19:53:44,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:44,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242243320] [2019-11-19 19:53:44,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:44,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:44,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836554864] [2019-11-19 19:53:44,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:44,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:44,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:44,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:44,237 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand 3 states. [2019-11-19 19:53:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:44,388 INFO L93 Difference]: Finished difference Result 415 states and 611 transitions. [2019-11-19 19:53:44,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:44,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-19 19:53:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:44,391 INFO L225 Difference]: With dead ends: 415 [2019-11-19 19:53:44,391 INFO L226 Difference]: Without dead ends: 225 [2019-11-19 19:53:44,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-19 19:53:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 209. [2019-11-19 19:53:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-19 19:53:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 310 transitions. [2019-11-19 19:53:44,403 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 310 transitions. Word has length 33 [2019-11-19 19:53:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:44,404 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 310 transitions. [2019-11-19 19:53:44,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2019-11-19 19:53:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 19:53:44,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:44,407 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:44,407 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash 130507052, now seen corresponding path program 1 times [2019-11-19 19:53:44,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:44,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145712281] [2019-11-19 19:53:44,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:44,423 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 19:53:44,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278248919] [2019-11-19 19:53:44,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:44,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 19:53:44,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:44,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145712281] [2019-11-19 19:53:44,557 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 19:53:44,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278248919] [2019-11-19 19:53:44,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:44,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:44,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616823298] [2019-11-19 19:53:44,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:44,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:44,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:44,560 INFO L87 Difference]: Start difference. First operand 209 states and 310 transitions. Second operand 3 states. [2019-11-19 19:53:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:44,606 INFO L93 Difference]: Finished difference Result 613 states and 908 transitions. [2019-11-19 19:53:44,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:44,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-19 19:53:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:44,610 INFO L225 Difference]: With dead ends: 613 [2019-11-19 19:53:44,610 INFO L226 Difference]: Without dead ends: 411 [2019-11-19 19:53:44,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-19 19:53:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 394. [2019-11-19 19:53:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-11-19 19:53:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 600 transitions. [2019-11-19 19:53:44,631 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 600 transitions. Word has length 43 [2019-11-19 19:53:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:44,631 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 600 transitions. [2019-11-19 19:53:44,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 600 transitions. [2019-11-19 19:53:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 19:53:44,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:44,634 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:44,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:44,840 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:44,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 130508974, now seen corresponding path program 1 times [2019-11-19 19:53:44,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:44,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076641471] [2019-11-19 19:53:44,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:44,851 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 19:53:44,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395388397] [2019-11-19 19:53:44,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:44,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:53:44,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:44,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076641471] [2019-11-19 19:53:44,929 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 19:53:44,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395388397] [2019-11-19 19:53:44,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:44,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:44,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948842698] [2019-11-19 19:53:44,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:44,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:44,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:44,931 INFO L87 Difference]: Start difference. First operand 394 states and 600 transitions. Second operand 3 states. [2019-11-19 19:53:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:45,135 INFO L93 Difference]: Finished difference Result 894 states and 1372 transitions. [2019-11-19 19:53:45,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:45,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-19 19:53:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:45,140 INFO L225 Difference]: With dead ends: 894 [2019-11-19 19:53:45,141 INFO L226 Difference]: Without dead ends: 507 [2019-11-19 19:53:45,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-19 19:53:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 470. [2019-11-19 19:53:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-11-19 19:53:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 690 transitions. [2019-11-19 19:53:45,163 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 690 transitions. Word has length 43 [2019-11-19 19:53:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:45,165 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 690 transitions. [2019-11-19 19:53:45,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 690 transitions. [2019-11-19 19:53:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 19:53:45,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:45,167 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:45,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:45,371 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:45,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1932390070, now seen corresponding path program 1 times [2019-11-19 19:53:45,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:45,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032192284] [2019-11-19 19:53:45,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:45,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032192284] [2019-11-19 19:53:45,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:45,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:45,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130783141] [2019-11-19 19:53:45,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:45,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:45,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:45,417 INFO L87 Difference]: Start difference. First operand 470 states and 690 transitions. Second operand 3 states. [2019-11-19 19:53:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:45,610 INFO L93 Difference]: Finished difference Result 585 states and 852 transitions. [2019-11-19 19:53:45,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:45,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-19 19:53:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:45,613 INFO L225 Difference]: With dead ends: 585 [2019-11-19 19:53:45,614 INFO L226 Difference]: Without dead ends: 566 [2019-11-19 19:53:45,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-19 19:53:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-11-19 19:53:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-11-19 19:53:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 830 transitions. [2019-11-19 19:53:45,636 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 830 transitions. Word has length 45 [2019-11-19 19:53:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:45,637 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 830 transitions. [2019-11-19 19:53:45,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 830 transitions. [2019-11-19 19:53:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 19:53:45,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:45,639 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:45,639 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1118595118, now seen corresponding path program 1 times [2019-11-19 19:53:45,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:45,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023006699] [2019-11-19 19:53:45,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:45,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023006699] [2019-11-19 19:53:45,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:45,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:45,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584082953] [2019-11-19 19:53:45,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:45,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:45,679 INFO L87 Difference]: Start difference. First operand 566 states and 830 transitions. Second operand 3 states. [2019-11-19 19:53:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:45,849 INFO L93 Difference]: Finished difference Result 1187 states and 1723 transitions. [2019-11-19 19:53:45,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:45,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-19 19:53:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:45,854 INFO L225 Difference]: With dead ends: 1187 [2019-11-19 19:53:45,854 INFO L226 Difference]: Without dead ends: 602 [2019-11-19 19:53:45,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-19 19:53:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 589. [2019-11-19 19:53:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-11-19 19:53:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 859 transitions. [2019-11-19 19:53:45,878 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 859 transitions. Word has length 46 [2019-11-19 19:53:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:45,878 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 859 transitions. [2019-11-19 19:53:45,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 859 transitions. [2019-11-19 19:53:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 19:53:45,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:45,880 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:45,880 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash -849837809, now seen corresponding path program 1 times [2019-11-19 19:53:45,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:45,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403211405] [2019-11-19 19:53:45,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:45,894 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 19:53:45,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139452314] [2019-11-19 19:53:45,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:45,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 19:53:45,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:45,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403211405] [2019-11-19 19:53:45,992 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 19:53:45,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139452314] [2019-11-19 19:53:45,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:45,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:53:45,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360855405] [2019-11-19 19:53:45,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:45,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:46,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:46,000 INFO L87 Difference]: Start difference. First operand 589 states and 859 transitions. Second operand 3 states. [2019-11-19 19:53:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:46,058 INFO L93 Difference]: Finished difference Result 1213 states and 1741 transitions. [2019-11-19 19:53:46,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:46,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-19 19:53:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:46,065 INFO L225 Difference]: With dead ends: 1213 [2019-11-19 19:53:46,065 INFO L226 Difference]: Without dead ends: 901 [2019-11-19 19:53:46,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-11-19 19:53:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 859. [2019-11-19 19:53:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-19 19:53:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1267 transitions. [2019-11-19 19:53:46,102 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1267 transitions. Word has length 59 [2019-11-19 19:53:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:46,103 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1267 transitions. [2019-11-19 19:53:46,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1267 transitions. [2019-11-19 19:53:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 19:53:46,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:46,107 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:46,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:46,311 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash -849835887, now seen corresponding path program 1 times [2019-11-19 19:53:46,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:46,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339903957] [2019-11-19 19:53:46,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:46,333 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 19:53:46,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023436094] [2019-11-19 19:53:46,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:46,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 19:53:46,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:46,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339903957] [2019-11-19 19:53:46,418 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 19:53:46,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023436094] [2019-11-19 19:53:46,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:46,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:53:46,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32820938] [2019-11-19 19:53:46,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:46,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:46,423 INFO L87 Difference]: Start difference. First operand 859 states and 1267 transitions. Second operand 3 states. [2019-11-19 19:53:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:46,588 INFO L93 Difference]: Finished difference Result 1786 states and 2639 transitions. [2019-11-19 19:53:46,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:46,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-19 19:53:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:46,597 INFO L225 Difference]: With dead ends: 1786 [2019-11-19 19:53:46,597 INFO L226 Difference]: Without dead ends: 934 [2019-11-19 19:53:46,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-19 19:53:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 922. [2019-11-19 19:53:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-11-19 19:53:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1345 transitions. [2019-11-19 19:53:46,630 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1345 transitions. Word has length 59 [2019-11-19 19:53:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:46,630 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1345 transitions. [2019-11-19 19:53:46,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1345 transitions. [2019-11-19 19:53:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-19 19:53:46,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:46,632 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:46,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:46,836 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:46,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1593799391, now seen corresponding path program 1 times [2019-11-19 19:53:46,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:46,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51263649] [2019-11-19 19:53:46,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:46,851 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 19:53:46,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [377971898] [2019-11-19 19:53:46,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:53:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:53:47,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:53:47,102 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 19:53:47,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:47,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:53:47 BoogieIcfgContainer [2019-11-19 19:53:47,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 19:53:47,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:53:47,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:53:47,383 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:53:47,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:42" (3/4) ... [2019-11-19 19:53:47,388 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 19:53:47,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:53:47,391 INFO L168 Benchmark]: Toolchain (without parser) took 6797.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 955.0 MB in the beginning and 861.6 MB in the end (delta: 93.4 MB). Peak memory consumption was 311.0 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:47,392 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:47,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:47,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:47,406 INFO L168 Benchmark]: Boogie Preprocessor took 79.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:47,408 INFO L168 Benchmark]: RCFGBuilder took 920.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:47,408 INFO L168 Benchmark]: TraceAbstraction took 5227.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 861.6 MB in the end (delta: 215.1 MB). Peak memory consumption was 281.6 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:47,410 INFO L168 Benchmark]: Witness Printer took 5.74 ms. Allocated memory is still 1.2 GB. Free memory is still 861.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:47,413 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 920.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5227.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 861.6 MB in the end (delta: 215.1 MB). Peak memory consumption was 281.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.74 ms. Allocated memory is still 1.2 GB. Free memory is still 861.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 543]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 88. Possible FailurePath: [L687] int s ; [L688] int tmp ; [L692] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int(); [L13] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int(); [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int(); [L21] int s__rwstate ; [L22] int s__init_buf___0 ; [L23] int s__debug = __VERIFIER_nondet_int(); [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int(); [L26] int s__options = __VERIFIER_nondet_int(); [L27] int s__verify_mode = __VERIFIER_nondet_int(); [L28] int s__session__peer = __VERIFIER_nondet_int(); [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int(); [L30] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L31] int s__ctx__stats__sess_accept_renegotiate ; [L32] int s__ctx__stats__sess_accept ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int(); [L41] int s__session__cipher ; [L42] int buf = __VERIFIER_nondet_int(); [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp = __VERIFIER_nondet_ulong(); [L46] int cb ; [L47] long num1 ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int(); [L54] int tmp___2 = __VERIFIER_nondet_int(); [L55] int tmp___3 ; [L56] int tmp___4 ; [L57] int tmp___5 ; [L58] int tmp___6 ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long(); [L61] int tmp___9 ; [L62] int tmp___10 ; [L63] int blastFlag ; [L64] int ag_X ; [L65] int ag_Y = __VERIFIER_nondet_int(); [L66] int ag_Z ; [L67] int __retres70 ; [L71] s__state = initial_state [L72] blastFlag = 0 [L73] Time = tmp [L74] cb = 0 [L75] ret = -1 [L76] skip = 0 [L77] got_new_session = 0 [L78] COND TRUE s__info_callback != 0 [L79] cb = s__info_callback [L87] s__in_handshake = s__in_handshake + 1 [L88] COND FALSE !(tmp___1 & 12288) [L97] COND FALSE !(s__cert == 0) [L104] COND TRUE 1 [L106] state = s__state [L107] COND FALSE !(s__state == 12292) [L110] COND FALSE !(s__state == 16384) [L113] COND FALSE !(s__state == 8192) [L116] COND FALSE !(s__state == 24576) [L119] COND FALSE !(s__state == 8195) [L122] COND FALSE !(s__state == 8480) [L125] COND FALSE !(s__state == 8481) [L128] COND FALSE !(s__state == 8482) [L131] COND TRUE s__state == 8464 [L289] s__shutdown = 0 [L290] ret = __VERIFIER_nondet_int() [L291] COND TRUE blastFlag == 0 [L292] blastFlag = 1 [L296] COND FALSE !(ret <= 0) [L301] got_new_session = 1 [L302] s__state = 8496 [L303] s__init_num = 0 [L636] COND FALSE !(! s__s3__tmp__reuse_message) [L665] skip = 0 [L104] COND TRUE 1 [L106] state = s__state [L107] COND FALSE !(s__state == 12292) [L110] COND FALSE !(s__state == 16384) [L113] COND FALSE !(s__state == 8192) [L116] COND FALSE !(s__state == 24576) [L119] COND FALSE !(s__state == 8195) [L122] COND FALSE !(s__state == 8480) [L125] COND FALSE !(s__state == 8481) [L128] COND FALSE !(s__state == 8482) [L131] COND FALSE !(s__state == 8464) [L134] COND FALSE !(s__state == 8465) [L137] COND FALSE !(s__state == 8466) [L140] COND TRUE s__state == 8496 [L307] ret = __VERIFIER_nondet_int() [L308] COND TRUE blastFlag == 1 [L309] blastFlag = 2 [L313] COND FALSE !(ret <= 0) [L318] COND TRUE \read(s__hit) [L319] s__state = 8656 [L323] s__init_num = 0 [L636] COND FALSE !(! s__s3__tmp__reuse_message) [L665] skip = 0 [L104] COND TRUE 1 [L106] state = s__state [L107] COND FALSE !(s__state == 12292) [L110] COND FALSE !(s__state == 16384) [L113] COND FALSE !(s__state == 8192) [L116] COND FALSE !(s__state == 24576) [L119] COND FALSE !(s__state == 8195) [L122] COND FALSE !(s__state == 8480) [L125] COND FALSE !(s__state == 8481) [L128] COND FALSE !(s__state == 8482) [L131] COND FALSE !(s__state == 8464) [L134] COND FALSE !(s__state == 8465) [L137] COND FALSE !(s__state == 8466) [L140] COND FALSE !(s__state == 8496) [L143] COND FALSE !(s__state == 8497) [L146] COND FALSE !(s__state == 8512) [L149] COND FALSE !(s__state == 8513) [L152] COND FALSE !(s__state == 8528) [L155] COND FALSE !(s__state == 8529) [L158] COND FALSE !(s__state == 8544) [L161] COND FALSE !(s__state == 8545) [L164] COND FALSE !(s__state == 8560) [L167] COND FALSE !(s__state == 8561) [L170] COND FALSE !(s__state == 8448) [L173] COND FALSE !(s__state == 8576) [L176] COND FALSE !(s__state == 8577) [L179] COND FALSE !(s__state == 8592) [L182] COND FALSE !(s__state == 8593) [L185] COND FALSE !(s__state == 8608) [L188] COND FALSE !(s__state == 8609) [L191] COND FALSE !(s__state == 8640) [L194] COND FALSE !(s__state == 8641) [L197] COND TRUE s__state == 8656 [L524] s__session__cipher = s__s3__tmp__new_cipher [L525] tmp___9 = __VERIFIER_nondet_int() [L526] COND FALSE !(! tmp___9) [L532] ret = __VERIFIER_nondet_int() [L533] COND TRUE blastFlag == 2 [L534] blastFlag = 3 [L538] COND FALSE !(ret <= 0) [L543] ag_X * ag_Y - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 12 error locations. Result: UNSAFE, OverallTime: 5.1s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2218 SDtfs, 1975 SDslu, 837 SDs, 0 SdLazy, 1058 SolverSat, 352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=922occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 189 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 46586 SizeOfPredicates, 4 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 25/25 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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 Received shutdown request...