./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00d015cea7b11aabc3ddec4842024b6b03cb0eb9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/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-cad4683 [2019-10-22 11:25:43,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:43,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:43,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:43,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:43,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:43,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:43,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:43,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:43,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:43,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:43,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:43,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:43,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:43,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:43,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:43,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:43,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:43,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:43,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:43,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:43,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:43,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:43,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:43,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:43,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:43,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:43,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:43,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:43,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:43,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:43,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:43,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:43,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:43,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:43,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:43,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:43,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:43,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:43,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:43,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:43,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-10-22 11:25:43,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:43,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:43,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:43,403 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:43,406 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:43,406 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:43,406 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:43,406 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:43,407 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:43,407 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:43,407 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:43,407 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:43,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:43,408 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:43,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:25:43,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:43,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:43,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:43,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:43,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:43,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:43,409 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 11:25:43,409 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:43,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:43,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:43,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:43,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:43,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:43,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:43,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:43,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:43,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:43,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:43,411 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:43,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:43,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:43,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:43,412 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan 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 -> Taipan 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-10-22 11:25:43,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:43,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:43,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:43,466 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:43,466 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:43,467 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/../../sv-benchmarks/c/bitvector/s3_srvr_1a_alt.BV.c.cil.c [2019-10-22 11:25:43,515 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/data/d5f9e9c30/629da69fc5be4d8bbb2ce6023d9bdcae/FLAGe8e6c2e1e [2019-10-22 11:25:43,941 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:43,942 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/sv-benchmarks/c/bitvector/s3_srvr_1a_alt.BV.c.cil.c [2019-10-22 11:25:43,950 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/data/d5f9e9c30/629da69fc5be4d8bbb2ce6023d9bdcae/FLAGe8e6c2e1e [2019-10-22 11:25:43,962 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/data/d5f9e9c30/629da69fc5be4d8bbb2ce6023d9bdcae [2019-10-22 11:25:43,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:43,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:43,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:43,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:43,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:43,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:43" (1/1) ... [2019-10-22 11:25:43,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcdc8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:43, skipping insertion in model container [2019-10-22 11:25:43,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:43" (1/1) ... [2019-10-22 11:25:43,979 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:44,011 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:44,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:44,294 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:44,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:44,360 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:44,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44 WrapperNode [2019-10-22 11:25:44,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:44,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:44,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:44,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:44,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:44,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:44,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:44,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:44,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... [2019-10-22 11:25:44,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:44,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:44,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:44,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:44,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/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-10-22 11:25:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:44,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:44,692 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:25:45,403 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 11:25:45,404 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 11:25:45,405 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:45,405 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:25:45,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:45 BoogieIcfgContainer [2019-10-22 11:25:45,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:45,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:45,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:45,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:45,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:43" (1/3) ... [2019-10-22 11:25:45,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9add05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:45, skipping insertion in model container [2019-10-22 11:25:45,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:44" (2/3) ... [2019-10-22 11:25:45,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9add05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:45, skipping insertion in model container [2019-10-22 11:25:45,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:45" (3/3) ... [2019-10-22 11:25:45,413 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_alt.BV.c.cil.c [2019-10-22 11:25:45,422 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:45,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-10-22 11:25:45,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-10-22 11:25:45,459 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:45,459 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:45,459 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:45,459 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:45,460 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:45,460 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:45,460 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:45,460 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-10-22 11:25:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:25:45,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:45,484 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:45,486 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:45,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-10-22 11:25:45,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:45,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679424386] [2019-10-22 11:25:45,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:45,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679424386] [2019-10-22 11:25:45,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:45,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:45,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051471022] [2019-10-22 11:25:45,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:45,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:45,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:45,666 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2019-10-22 11:25:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:45,937 INFO L93 Difference]: Finished difference Result 343 states and 551 transitions. [2019-10-22 11:25:45,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:45,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:25:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:45,949 INFO L225 Difference]: With dead ends: 343 [2019-10-22 11:25:45,949 INFO L226 Difference]: Without dead ends: 168 [2019-10-22 11:25:45,952 INFO L600 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-10-22 11:25:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-22 11:25:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-10-22 11:25:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-22 11:25:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2019-10-22 11:25:45,995 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 243 transitions. Word has length 17 [2019-10-22 11:25:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:45,996 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-10-22 11:25:45,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 243 transitions. [2019-10-22 11:25:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:25:45,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:45,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:45,997 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:45,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-10-22 11:25:45,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:45,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958771372] [2019-10-22 11:25:45,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:45,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:46,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958771372] [2019-10-22 11:25:46,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:46,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:46,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611778253] [2019-10-22 11:25:46,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:46,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:46,037 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. Second operand 3 states. [2019-10-22 11:25:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,194 INFO L93 Difference]: Finished difference Result 339 states and 488 transitions. [2019-10-22 11:25:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:46,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 11:25:46,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,196 INFO L225 Difference]: With dead ends: 339 [2019-10-22 11:25:46,196 INFO L226 Difference]: Without dead ends: 178 [2019-10-22 11:25:46,198 INFO L600 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-10-22 11:25:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-22 11:25:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2019-10-22 11:25:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-22 11:25:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2019-10-22 11:25:46,210 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 18 [2019-10-22 11:25:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,210 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2019-10-22 11:25:46,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2019-10-22 11:25:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:25:46,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,211 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:46,212 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-10-22 11:25:46,212 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929469424] [2019-10-22 11:25:46,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:46,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929469424] [2019-10-22 11:25:46,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:46,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:46,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048039447] [2019-10-22 11:25:46,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:46,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:46,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:46,281 INFO L87 Difference]: Start difference. First operand 169 states and 244 transitions. Second operand 3 states. [2019-10-22 11:25:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,438 INFO L93 Difference]: Finished difference Result 341 states and 490 transitions. [2019-10-22 11:25:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:46,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:25:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,440 INFO L225 Difference]: With dead ends: 341 [2019-10-22 11:25:46,440 INFO L226 Difference]: Without dead ends: 179 [2019-10-22 11:25:46,441 INFO L600 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-10-22 11:25:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-22 11:25:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 170. [2019-10-22 11:25:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-22 11:25:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2019-10-22 11:25:46,465 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 19 [2019-10-22 11:25:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,465 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2019-10-22 11:25:46,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2019-10-22 11:25:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:25:46,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:46,467 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:46,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,474 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-10-22 11:25:46,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838661685] [2019-10-22 11:25:46,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:46,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838661685] [2019-10-22 11:25:46,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:46,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:46,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227127805] [2019-10-22 11:25:46,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:46,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:46,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:46,528 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand 3 states. [2019-10-22 11:25:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,675 INFO L93 Difference]: Finished difference Result 343 states and 492 transitions. [2019-10-22 11:25:46,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:46,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 11:25:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,680 INFO L225 Difference]: With dead ends: 343 [2019-10-22 11:25:46,680 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 11:25:46,681 INFO L600 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-10-22 11:25:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 11:25:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2019-10-22 11:25:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-22 11:25:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2019-10-22 11:25:46,694 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 20 [2019-10-22 11:25:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,695 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2019-10-22 11:25:46,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2019-10-22 11:25:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:25:46,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,700 INFO L380 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-10-22 11:25:46,700 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,701 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-10-22 11:25:46,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267628364] [2019-10-22 11:25:46,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:46,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267628364] [2019-10-22 11:25:46,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:46,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:46,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436540198] [2019-10-22 11:25:46,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:46,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:46,758 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand 3 states. [2019-10-22 11:25:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:46,910 INFO L93 Difference]: Finished difference Result 345 states and 494 transitions. [2019-10-22 11:25:46,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:46,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 11:25:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:46,912 INFO L225 Difference]: With dead ends: 345 [2019-10-22 11:25:46,912 INFO L226 Difference]: Without dead ends: 181 [2019-10-22 11:25:46,913 INFO L600 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-10-22 11:25:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-22 11:25:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2019-10-22 11:25:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-22 11:25:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 247 transitions. [2019-10-22 11:25:46,935 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 247 transitions. Word has length 21 [2019-10-22 11:25:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:46,935 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 247 transitions. [2019-10-22 11:25:46,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 247 transitions. [2019-10-22 11:25:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:25:46,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:46,937 INFO L380 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-10-22 11:25:46,937 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:46,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash -853626144, now seen corresponding path program 1 times [2019-10-22 11:25:46,938 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:46,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153684163] [2019-10-22 11:25:46,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:46,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:47,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153684163] [2019-10-22 11:25:47,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:47,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:47,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974836035] [2019-10-22 11:25:47,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:47,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:47,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:47,014 INFO L87 Difference]: Start difference. First operand 172 states and 247 transitions. Second operand 3 states. [2019-10-22 11:25:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:47,179 INFO L93 Difference]: Finished difference Result 378 states and 548 transitions. [2019-10-22 11:25:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:47,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-22 11:25:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:47,181 INFO L225 Difference]: With dead ends: 378 [2019-10-22 11:25:47,181 INFO L226 Difference]: Without dead ends: 213 [2019-10-22 11:25:47,182 INFO L600 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-10-22 11:25:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-22 11:25:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 197. [2019-10-22 11:25:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-22 11:25:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2019-10-22 11:25:47,197 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 32 [2019-10-22 11:25:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:47,197 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2019-10-22 11:25:47,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2019-10-22 11:25:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:25:47,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:47,199 INFO L380 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-10-22 11:25:47,199 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash 689633844, now seen corresponding path program 1 times [2019-10-22 11:25:47,200 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:47,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301787209] [2019-10-22 11:25:47,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:47,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301787209] [2019-10-22 11:25:47,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:47,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:47,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329505601] [2019-10-22 11:25:47,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:47,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:47,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:47,257 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand 3 states. [2019-10-22 11:25:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:47,408 INFO L93 Difference]: Finished difference Result 415 states and 611 transitions. [2019-10-22 11:25:47,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:47,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:25:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:47,410 INFO L225 Difference]: With dead ends: 415 [2019-10-22 11:25:47,410 INFO L226 Difference]: Without dead ends: 225 [2019-10-22 11:25:47,411 INFO L600 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-10-22 11:25:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-22 11:25:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 209. [2019-10-22 11:25:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-22 11:25:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 310 transitions. [2019-10-22 11:25:47,422 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 310 transitions. Word has length 33 [2019-10-22 11:25:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:47,422 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 310 transitions. [2019-10-22 11:25:47,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2019-10-22 11:25:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:25:47,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:47,425 INFO L380 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-10-22 11:25:47,426 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:47,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash 130507052, now seen corresponding path program 1 times [2019-10-22 11:25:47,426 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:47,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887605989] [2019-10-22 11:25:47,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:47,450 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 11:25:47,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599514900] [2019-10-22 11:25:47,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/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-10-22 11:25:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:47,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:25:47,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:47,563 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:47,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887605989] [2019-10-22 11:25:47,586 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 11:25:47,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599514900] [2019-10-22 11:25:47,587 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:47,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-10-22 11:25:47,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188826414] [2019-10-22 11:25:47,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:47,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:47,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:47,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:47,590 INFO L87 Difference]: Start difference. First operand 209 states and 310 transitions. Second operand 4 states. [2019-10-22 11:25:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:47,684 INFO L93 Difference]: Finished difference Result 812 states and 1203 transitions. [2019-10-22 11:25:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:47,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-22 11:25:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:47,688 INFO L225 Difference]: With dead ends: 812 [2019-10-22 11:25:47,688 INFO L226 Difference]: Without dead ends: 610 [2019-10-22 11:25:47,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-22 11:25:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 576. [2019-10-22 11:25:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-22 11:25:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 887 transitions. [2019-10-22 11:25:47,728 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 887 transitions. Word has length 43 [2019-10-22 11:25:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:47,730 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 887 transitions. [2019-10-22 11:25:47,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 887 transitions. [2019-10-22 11:25:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:25:47,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:47,732 INFO L380 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-10-22 11:25:47,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:47,937 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash 130508974, now seen corresponding path program 1 times [2019-10-22 11:25:47,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:47,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614328238] [2019-10-22 11:25:47,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:47,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:47,948 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 11:25:47,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864125938] [2019-10-22 11:25:47,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/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-10-22 11:25:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:47,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:25:48,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:48,013 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:48,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614328238] [2019-10-22 11:25:48,023 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 11:25:48,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864125938] [2019-10-22 11:25:48,023 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:48,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-10-22 11:25:48,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834548899] [2019-10-22 11:25:48,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:48,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:48,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:48,025 INFO L87 Difference]: Start difference. First operand 576 states and 887 transitions. Second operand 4 states. [2019-10-22 11:25:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:48,288 INFO L93 Difference]: Finished difference Result 1446 states and 2265 transitions. [2019-10-22 11:25:48,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:48,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-22 11:25:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:48,293 INFO L225 Difference]: With dead ends: 1446 [2019-10-22 11:25:48,293 INFO L226 Difference]: Without dead ends: 877 [2019-10-22 11:25:48,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-10-22 11:25:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 803. [2019-10-22 11:25:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-10-22 11:25:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1219 transitions. [2019-10-22 11:25:48,322 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1219 transitions. Word has length 43 [2019-10-22 11:25:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:48,322 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1219 transitions. [2019-10-22 11:25:48,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1219 transitions. [2019-10-22 11:25:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:25:48,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:48,324 INFO L380 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-10-22 11:25:48,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:48,524 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1932390070, now seen corresponding path program 1 times [2019-10-22 11:25:48,525 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:48,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301030692] [2019-10-22 11:25:48,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:48,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:48,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:48,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301030692] [2019-10-22 11:25:48,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:48,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:48,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231112813] [2019-10-22 11:25:48,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:48,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:48,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:48,560 INFO L87 Difference]: Start difference. First operand 803 states and 1219 transitions. Second operand 3 states. [2019-10-22 11:25:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:48,759 INFO L93 Difference]: Finished difference Result 966 states and 1453 transitions. [2019-10-22 11:25:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:48,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 11:25:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:48,763 INFO L225 Difference]: With dead ends: 966 [2019-10-22 11:25:48,763 INFO L226 Difference]: Without dead ends: 947 [2019-10-22 11:25:48,765 INFO L600 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-10-22 11:25:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-10-22 11:25:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2019-10-22 11:25:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-10-22 11:25:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1426 transitions. [2019-10-22 11:25:48,793 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1426 transitions. Word has length 45 [2019-10-22 11:25:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:48,793 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1426 transitions. [2019-10-22 11:25:48,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1426 transitions. [2019-10-22 11:25:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 11:25:48,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:48,794 INFO L380 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-10-22 11:25:48,795 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1118595118, now seen corresponding path program 1 times [2019-10-22 11:25:48,795 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:48,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854304317] [2019-10-22 11:25:48,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:48,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:48,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:48,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854304317] [2019-10-22 11:25:48,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:48,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:48,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333069193] [2019-10-22 11:25:48,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:48,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:48,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:48,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:48,832 INFO L87 Difference]: Start difference. First operand 947 states and 1426 transitions. Second operand 3 states. [2019-10-22 11:25:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:48,982 INFO L93 Difference]: Finished difference Result 1980 states and 2952 transitions. [2019-10-22 11:25:48,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:48,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-22 11:25:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:48,987 INFO L225 Difference]: With dead ends: 1980 [2019-10-22 11:25:48,987 INFO L226 Difference]: Without dead ends: 1001 [2019-10-22 11:25:48,989 INFO L600 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-10-22 11:25:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-10-22 11:25:49,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 975. [2019-10-22 11:25:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-10-22 11:25:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1460 transitions. [2019-10-22 11:25:49,017 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1460 transitions. Word has length 46 [2019-10-22 11:25:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:49,018 INFO L462 AbstractCegarLoop]: Abstraction has 975 states and 1460 transitions. [2019-10-22 11:25:49,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1460 transitions. [2019-10-22 11:25:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:25:49,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:49,020 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:25:49,021 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1663205935, now seen corresponding path program 1 times [2019-10-22 11:25:49,021 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:49,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212927959] [2019-10-22 11:25:49,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:49,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212927959] [2019-10-22 11:25:49,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:49,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:49,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290246843] [2019-10-22 11:25:49,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:49,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:49,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,057 INFO L87 Difference]: Start difference. First operand 975 states and 1460 transitions. Second operand 3 states. [2019-10-22 11:25:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:49,200 INFO L93 Difference]: Finished difference Result 1711 states and 2554 transitions. [2019-10-22 11:25:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:49,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-22 11:25:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:49,203 INFO L225 Difference]: With dead ends: 1711 [2019-10-22 11:25:49,203 INFO L226 Difference]: Without dead ends: 743 [2019-10-22 11:25:49,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-10-22 11:25:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 735. [2019-10-22 11:25:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-10-22 11:25:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1073 transitions. [2019-10-22 11:25:49,229 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1073 transitions. Word has length 68 [2019-10-22 11:25:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:49,229 INFO L462 AbstractCegarLoop]: Abstraction has 735 states and 1073 transitions. [2019-10-22 11:25:49,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1073 transitions. [2019-10-22 11:25:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 11:25:49,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:49,231 INFO L380 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-10-22 11:25:49,231 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:25:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1593799391, now seen corresponding path program 1 times [2019-10-22 11:25:49,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:49,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084383770] [2019-10-22 11:25:49,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:49,242 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 11:25:49,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763005066] [2019-10-22 11:25:49,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa3b697c-d596-466a-9241-4a6a0d9beb81/bin/utaipan/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-10-22 11:25:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:49,468 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:25:49,468 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:25:49,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:49,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:49 BoogieIcfgContainer [2019-10-22 11:25:49,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:49,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:49,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:49,726 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:49,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:45" (3/4) ... [2019-10-22 11:25:49,730 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:25:49,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:49,732 INFO L168 Benchmark]: Toolchain (without parser) took 5766.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 941.8 MB in the beginning and 894.2 MB in the end (delta: 47.6 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:49,733 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:49,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:49,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.06 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:49,737 INFO L168 Benchmark]: Boogie Preprocessor took 37.88 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:49,737 INFO L168 Benchmark]: RCFGBuilder took 950.86 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: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:49,738 INFO L168 Benchmark]: TraceAbstraction took 4318.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 899.2 MB in the end (delta: 156.1 MB). Peak memory consumption was 234.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:49,738 INFO L168 Benchmark]: Witness Printer took 4.39 ms. Allocated memory is still 1.2 GB. Free memory was 899.2 MB in the beginning and 894.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:49,743 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.06 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.88 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 950.86 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: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4318.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 899.2 MB in the end (delta: 156.1 MB). Peak memory consumption was 234.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.39 ms. Allocated memory is still 1.2 GB. Free memory was 899.2 MB in the beginning and 894.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. 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: 4.2s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1985 SDtfs, 2094 SDslu, 849 SDs, 0 SdLazy, 1113 SolverSat, 410 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=975occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 210 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 50107 SizeOfPredicates, 4 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 43/43 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...