./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 424a421197f4ce84b83a2829176da10a33705ff6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 424a421197f4ce84b83a2829176da10a33705ff6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:15:15,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:15:15,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:15:15,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:15:15,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:15:15,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:15:15,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:15:15,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:15:15,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:15:15,342 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:15:15,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:15:15,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:15:15,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:15:15,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:15:15,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:15:15,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:15:15,349 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:15:15,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:15:15,355 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:15:15,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:15:15,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:15:15,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:15:15,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:15:15,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:15:15,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:15:15,366 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:15:15,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:15:15,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:15:15,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:15:15,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:15:15,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:15:15,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:15:15,373 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:15:15,373 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:15:15,374 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:15:15,375 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:15:15,375 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:15:15,393 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:15:15,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:15:15,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:15:15,395 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:15:15,395 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:15:15,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:15:15,396 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:15:15,396 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:15:15,397 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:15:15,397 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:15:15,397 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:15:15,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:15:15,398 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:15:15,399 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:15:15,399 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:15:15,399 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:15:15,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:15:15,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:15:15,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:15:15,401 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:15:15,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:15:15,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:15,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:15:15,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:15:15,402 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:15:15,402 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:15:15,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:15:15,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:15:15,404 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 424a421197f4ce84b83a2829176da10a33705ff6 [2019-01-11 21:15:15,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:15:15,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:15:15,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:15:15,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:15:15,471 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:15:15,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:15,534 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82ca8fa2/f7dff5e969c6465f8c18313f521aa2de/FLAG6cc7cd457 [2019-01-11 21:15:15,999 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:15:16,000 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:16,015 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82ca8fa2/f7dff5e969c6465f8c18313f521aa2de/FLAG6cc7cd457 [2019-01-11 21:15:16,332 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82ca8fa2/f7dff5e969c6465f8c18313f521aa2de [2019-01-11 21:15:16,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:15:16,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:15:16,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:16,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:15:16,343 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:15:16,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:16,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43fcd915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16, skipping insertion in model container [2019-01-11 21:15:16,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:16,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:15:16,420 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:15:16,737 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:16,746 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:15:16,803 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:16,818 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:15:16,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16 WrapperNode [2019-01-11 21:15:16,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:16,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:16,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:15:16,821 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:15:16,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:16,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:16,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:16,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:15:16,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:15:16,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:15:16,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:16,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:16,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:16,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:16,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:17,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:17,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... [2019-01-11 21:15:17,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:15:17,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:15:17,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:15:17,012 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:15:17,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:15:17,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:15:17,223 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:15:18,233 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:15:18,233 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:15:18,235 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:15:18,235 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:15:18,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:18 BoogieIcfgContainer [2019-01-11 21:15:18,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:15:18,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:15:18,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:15:18,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:15:18,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:15:16" (1/3) ... [2019-01-11 21:15:18,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd9109c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:18, skipping insertion in model container [2019-01-11 21:15:18,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:16" (2/3) ... [2019-01-11 21:15:18,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd9109c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:18, skipping insertion in model container [2019-01-11 21:15:18,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:18" (3/3) ... [2019-01-11 21:15:18,244 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:18,254 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:15:18,263 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:15:18,282 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:15:18,315 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:15:18,316 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:15:18,316 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:15:18,317 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:15:18,317 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:15:18,317 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:15:18,317 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:15:18,317 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:15:18,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:15:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-01-11 21:15:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:15:18,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:18,346 INFO L402 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] [2019-01-11 21:15:18,348 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582915, now seen corresponding path program 1 times [2019-01-11 21:15:18,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:18,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:18,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:15:18,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:18,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:15:18,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:18,597 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-01-11 21:15:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:18,965 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2019-01-11 21:15:18,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:18,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:15:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:18,981 INFO L225 Difference]: With dead ends: 247 [2019-01-11 21:15:18,981 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 21:15:18,985 INFO L631 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-01-11 21:15:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 21:15:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-11 21:15:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 21:15:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2019-01-11 21:15:19,035 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 23 [2019-01-11 21:15:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:19,036 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2019-01-11 21:15:19,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2019-01-11 21:15:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 21:15:19,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:19,038 INFO L402 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] [2019-01-11 21:15:19,039 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1463943324, now seen corresponding path program 1 times [2019-01-11 21:15:19,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:19,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:19,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:19,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:19,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:15:19,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:19,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:19,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:19,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:19,163 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2019-01-11 21:15:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:19,780 INFO L93 Difference]: Finished difference Result 233 states and 355 transitions. [2019-01-11 21:15:19,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:19,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-11 21:15:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:19,784 INFO L225 Difference]: With dead ends: 233 [2019-01-11 21:15:19,784 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 21:15:19,786 INFO L631 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-01-11 21:15:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 21:15:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-01-11 21:15:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 21:15:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2019-01-11 21:15:19,804 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2019-01-11 21:15:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:19,804 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2019-01-11 21:15:19,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2019-01-11 21:15:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 21:15:19,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:19,807 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:19,807 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1876827341, now seen corresponding path program 1 times [2019-01-11 21:15:19,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:19,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:19,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:19,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:19,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:15:19,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:19,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:19,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:19,916 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2019-01-11 21:15:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:20,171 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2019-01-11 21:15:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:20,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-11 21:15:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:20,177 INFO L225 Difference]: With dead ends: 266 [2019-01-11 21:15:20,177 INFO L226 Difference]: Without dead ends: 148 [2019-01-11 21:15:20,178 INFO L631 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-01-11 21:15:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-11 21:15:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-01-11 21:15:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-11 21:15:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2019-01-11 21:15:20,191 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2019-01-11 21:15:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:20,191 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2019-01-11 21:15:20,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2019-01-11 21:15:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:15:20,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:20,194 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:15:20,195 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:20,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash -708368503, now seen corresponding path program 1 times [2019-01-11 21:15:20,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:20,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:20,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:20,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:15:20,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:20,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:20,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:20,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:20,306 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 3 states. [2019-01-11 21:15:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:20,663 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-01-11 21:15:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:20,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:15:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:20,668 INFO L225 Difference]: With dead ends: 330 [2019-01-11 21:15:20,668 INFO L226 Difference]: Without dead ends: 194 [2019-01-11 21:15:20,670 INFO L631 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-01-11 21:15:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-11 21:15:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2019-01-11 21:15:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 21:15:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2019-01-11 21:15:20,683 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2019-01-11 21:15:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:20,684 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2019-01-11 21:15:20,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2019-01-11 21:15:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:15:20,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:20,689 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:15:20,689 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:20,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1781160459, now seen corresponding path program 1 times [2019-01-11 21:15:20,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:20,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:20,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:15:20,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:20,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:20,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:20,808 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand 3 states. [2019-01-11 21:15:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:21,053 INFO L93 Difference]: Finished difference Result 384 states and 549 transitions. [2019-01-11 21:15:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:21,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:15:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:21,056 INFO L225 Difference]: With dead ends: 384 [2019-01-11 21:15:21,057 INFO L226 Difference]: Without dead ends: 208 [2019-01-11 21:15:21,058 INFO L631 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-01-11 21:15:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-11 21:15:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2019-01-11 21:15:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-11 21:15:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2019-01-11 21:15:21,071 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2019-01-11 21:15:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:21,071 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2019-01-11 21:15:21,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2019-01-11 21:15:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:15:21,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:21,074 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-11 21:15:21,074 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1647185185, now seen corresponding path program 1 times [2019-01-11 21:15:21,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:21,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:21,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-11 21:15:21,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:21,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:21,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:21,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:21,201 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand 3 states. [2019-01-11 21:15:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:21,387 INFO L93 Difference]: Finished difference Result 423 states and 599 transitions. [2019-01-11 21:15:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:21,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:15:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:21,389 INFO L225 Difference]: With dead ends: 423 [2019-01-11 21:15:21,390 INFO L226 Difference]: Without dead ends: 228 [2019-01-11 21:15:21,391 INFO L631 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-01-11 21:15:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-01-11 21:15:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2019-01-11 21:15:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 21:15:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2019-01-11 21:15:21,401 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2019-01-11 21:15:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:21,402 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2019-01-11 21:15:21,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2019-01-11 21:15:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 21:15:21,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:21,405 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-11 21:15:21,405 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:21,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:21,405 INFO L82 PathProgramCache]: Analyzing trace with hash -629532647, now seen corresponding path program 1 times [2019-01-11 21:15:21,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:21,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-11 21:15:21,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:21,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:21,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:21,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:21,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:21,530 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand 3 states. [2019-01-11 21:15:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:21,796 INFO L93 Difference]: Finished difference Result 655 states and 906 transitions. [2019-01-11 21:15:21,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:21,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-11 21:15:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:21,807 INFO L225 Difference]: With dead ends: 655 [2019-01-11 21:15:21,813 INFO L226 Difference]: Without dead ends: 439 [2019-01-11 21:15:21,814 INFO L631 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-01-11 21:15:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-11 21:15:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-01-11 21:15:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-01-11 21:15:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 605 transitions. [2019-01-11 21:15:21,840 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 605 transitions. Word has length 103 [2019-01-11 21:15:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:21,840 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 605 transitions. [2019-01-11 21:15:21,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 605 transitions. [2019-01-11 21:15:21,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:15:21,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:21,845 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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-01-11 21:15:21,846 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash -548026749, now seen corresponding path program 1 times [2019-01-11 21:15:21,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:21,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:21,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:21,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:21,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:15:22,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:22,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:22,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:22,012 INFO L87 Difference]: Start difference. First operand 439 states and 605 transitions. Second operand 3 states. [2019-01-11 21:15:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:22,127 INFO L93 Difference]: Finished difference Result 655 states and 903 transitions. [2019-01-11 21:15:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:22,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:15:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:22,131 INFO L225 Difference]: With dead ends: 655 [2019-01-11 21:15:22,132 INFO L226 Difference]: Without dead ends: 653 [2019-01-11 21:15:22,132 INFO L631 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-01-11 21:15:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-01-11 21:15:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-01-11 21:15:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-01-11 21:15:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 901 transitions. [2019-01-11 21:15:22,151 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 901 transitions. Word has length 105 [2019-01-11 21:15:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:22,151 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 901 transitions. [2019-01-11 21:15:22,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 901 transitions. [2019-01-11 21:15:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-11 21:15:22,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:22,154 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2019-01-11 21:15:22,154 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:22,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:22,155 INFO L82 PathProgramCache]: Analyzing trace with hash 51406530, now seen corresponding path program 1 times [2019-01-11 21:15:22,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:22,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:22,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:22,182 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:15:22,183 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:15:22,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:15:22,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:22,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:15:22,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:22,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:22,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:22,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:22,396 INFO L87 Difference]: Start difference. First operand 653 states and 901 transitions. Second operand 3 states. [2019-01-11 21:15:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:23,132 INFO L93 Difference]: Finished difference Result 1377 states and 1926 transitions. [2019-01-11 21:15:23,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:23,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-01-11 21:15:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:23,140 INFO L225 Difference]: With dead ends: 1377 [2019-01-11 21:15:23,140 INFO L226 Difference]: Without dead ends: 733 [2019-01-11 21:15:23,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 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-01-11 21:15:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-01-11 21:15:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 722. [2019-01-11 21:15:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-01-11 21:15:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 985 transitions. [2019-01-11 21:15:23,166 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 985 transitions. Word has length 130 [2019-01-11 21:15:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:23,167 INFO L480 AbstractCegarLoop]: Abstraction has 722 states and 985 transitions. [2019-01-11 21:15:23,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 985 transitions. [2019-01-11 21:15:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-11 21:15:23,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:23,170 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2019-01-11 21:15:23,170 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -837503083, now seen corresponding path program 1 times [2019-01-11 21:15:23,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:23,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:23,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:23,187 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:15:23,187 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:15:23,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:15:23,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:23,594 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:15:23,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:15:23 BoogieIcfgContainer [2019-01-11 21:15:23,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:15:23,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:15:23,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:15:23,676 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:15:23,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:18" (3/4) ... [2019-01-11 21:15:23,680 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-11 21:15:23,680 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:15:23,681 INFO L168 Benchmark]: Toolchain (without parser) took 7344.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -112.8 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:23,683 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:15:23,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.64 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.8 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:23,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 929.8 MB in the beginning and 1.1 GB in the end (delta: -211.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:23,686 INFO L168 Benchmark]: Boogie Preprocessor took 52.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:23,686 INFO L168 Benchmark]: RCFGBuilder took 1224.61 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:23,687 INFO L168 Benchmark]: TraceAbstraction took 5437.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:23,688 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:15:23,693 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 480.64 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.8 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 929.8 MB in the beginning and 1.1 GB in the end (delta: -211.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1224.61 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5437.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 618]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L627] int __retres1 ; [L8] int s__info_callback = __VERIFIER_nondet_int(); [L9] int s__in_handshake = __VERIFIER_nondet_int(); [L10] int s__state ; [L11] int s__new_session ; [L12] int s__server ; [L13] int s__version = __VERIFIER_nondet_int(); [L14] int s__type ; [L15] int s__init_num ; [L16] int s__bbio = __VERIFIER_nondet_int(); [L17] int s__wbio = __VERIFIER_nondet_int(); [L18] int s__hit = __VERIFIER_nondet_int(); [L19] int s__rwstate ; [L20] int s__init_buf___0 ; [L21] int s__debug = __VERIFIER_nondet_int(); [L22] int s__shutdown ; [L23] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L24] int s__ctx__stats__sess_connect_renegotiate ; [L25] int s__ctx__stats__sess_connect ; [L26] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L27] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [L28] int s__s3__change_cipher_spec ; [L29] int s__s3__flags ; [L30] int s__s3__delay_buf_pop_ret ; [L31] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L32] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__next_state___0 ; [L37] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L38] int s__session__cipher ; [L39] int s__session__compress_meth ; [L40] int buf ; [L41] unsigned long tmp ; [L42] unsigned long l ; [L43] int num1 ; [L44] int cb ; [L45] int ret ; [L46] int new_state ; [L47] int state ; [L48] int skip ; [L49] int tmp___0 ; [L50] int tmp___1 ; [L51] int tmp___2 ; [L52] int tmp___3 ; [L53] int tmp___4 ; [L54] int tmp___5 ; [L55] int tmp___6 = __VERIFIER_nondet_int(); [L56] int tmp___7 = __VERIFIER_nondet_int(); [L57] int tmp___8 = __VERIFIER_nondet_int(); [L58] int tmp___9 = __VERIFIER_nondet_int(); [L59] int blastFlag ; [L60] int ag_X ; [L61] int ag_Y ; [L62] int ag_Z = __VERIFIER_nondet_int(); [L63] unsigned int ag_V ; [L64] unsigned int ag_W ; [L65] int __retres62 ; [L68] ag_V = 2U [L69] ag_W = 5U [L70] s__state = 12292 [L71] blastFlag = 0 [L72] tmp = __VERIFIER_nondet_int() [L73] cb = 0 [L74] ret = -1 [L75] skip = 0 [L76] tmp___0 = 0 [L77] COND TRUE s__info_callback != 0 [L78] cb = s__info_callback [L86] s__in_handshake = s__in_handshake + 1 [L87] tmp___1 = __VERIFIER_nondet_int() [L88] COND FALSE !(tmp___1 & 12288) [L99] COND TRUE 1 [L101] state = s__state [L102] COND TRUE s__state == 12292 [L205] s__new_session = 1 [L206] s__state = 4096 [L207] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L212] s__server = 0 [L213] COND TRUE cb != 0 [L218] COND FALSE !((s__version & 65280) != 768) [L224] s__type = 4096 [L225] COND FALSE !(s__init_buf___0 == 0) [L244] tmp___4 = __VERIFIER_nondet_int() [L245] COND FALSE !(! tmp___4) [L251] tmp___5 = __VERIFIER_nondet_int() [L252] COND FALSE !(! tmp___5) [L258] s__state = 4368 [L259] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L260] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND TRUE s__state == 4368 [L264] s__shutdown = 0 [L265] ret = __VERIFIER_nondet_int() [L266] COND TRUE blastFlag == 0 [L267] blastFlag = 1 [L271] COND FALSE !(ret <= 0) [L276] s__state = 4384 [L277] s__init_num = 0 [L278] COND TRUE s__bbio != s__wbio [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND TRUE s__state == 4384 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L292] COND FALSE !(ret <= 0) [L297] COND FALSE !(\read(s__hit)) [L300] s__state = 4400 [L302] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND TRUE s__state == 4400 [L306] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L309] ret = __VERIFIER_nondet_int() [L310] COND TRUE blastFlag == 2 [L311] blastFlag = 3 [L315] COND FALSE !(ret <= 0) [L321] s__state = 4416 [L322] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND TRUE s__state == 4416 [L326] ret = __VERIFIER_nondet_int() [L327] COND TRUE blastFlag == 3 [L328] blastFlag = 4 [L332] COND FALSE !(ret <= 0) [L337] s__state = 4432 [L338] s__init_num = 0 [L339] COND FALSE !(! tmp___6) [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L348] ret = __VERIFIER_nondet_int() [L349] COND FALSE !(blastFlag == 5) [L354] COND FALSE !(ret <= 0) [L359] s__state = 4448 [L360] ag_X = 44 [L361] ag_Y = 100 [L362] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND FALSE !(s__state == 4432) [L144] COND FALSE !(s__state == 4433) [L147] COND TRUE s__state == 4448 [L366] ret = __VERIFIER_nondet_int() [L367] COND TRUE blastFlag == 4 [L368] blastFlag = 5 [L372] COND FALSE !(ret <= 0) [L377] COND TRUE \read(s__s3__tmp__cert_req) [L378] s__state = ag_X * ag_Y + ag_Z [L382] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L348] ret = __VERIFIER_nondet_int() [L349] COND TRUE blastFlag == 5 [L618] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. UNSAFE Result, 5.3s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1540 SDtfs, 402 SDslu, 859 SDs, 0 SdLazy, 738 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 83783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 659/659 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:15:25,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:15:25,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:15:25,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:15:25,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:15:25,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:15:25,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:15:25,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:15:25,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:15:25,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:15:25,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:15:25,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:15:25,966 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:15:25,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:15:25,968 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:15:25,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:15:25,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:15:25,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:15:25,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:15:25,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:15:25,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:15:25,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:15:25,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:15:25,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:15:25,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:15:25,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:15:25,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:15:25,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:15:25,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:15:25,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:15:25,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:15:25,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:15:25,994 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:15:25,994 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:15:25,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:15:25,996 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:15:25,996 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-11 21:15:26,014 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:15:26,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:15:26,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:15:26,018 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:15:26,018 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:15:26,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:15:26,018 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:15:26,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:15:26,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:15:26,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:15:26,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:15:26,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:15:26,019 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-11 21:15:26,020 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-11 21:15:26,021 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:15:26,022 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:15:26,022 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:15:26,022 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:15:26,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:15:26,022 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:15:26,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:15:26,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:15:26,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:26,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:15:26,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:15:26,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:15:26,025 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-11 21:15:26,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:15:26,025 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-11 21:15:26,025 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-11 21:15:26,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 424a421197f4ce84b83a2829176da10a33705ff6 [2019-01-11 21:15:26,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:15:26,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:15:26,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:15:26,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:15:26,109 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:15:26,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:26,175 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffdd8137/34ba50c680624de4b2effc41fe3abfec/FLAG9cac0f57b [2019-01-11 21:15:26,608 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:15:26,610 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:26,627 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffdd8137/34ba50c680624de4b2effc41fe3abfec/FLAG9cac0f57b [2019-01-11 21:15:26,962 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffdd8137/34ba50c680624de4b2effc41fe3abfec [2019-01-11 21:15:26,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:15:26,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:15:26,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:26,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:15:26,974 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:15:26,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:26" (1/1) ... [2019-01-11 21:15:26,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b67301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:26, skipping insertion in model container [2019-01-11 21:15:26,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:26" (1/1) ... [2019-01-11 21:15:26,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:15:27,026 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:15:27,317 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:27,329 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:15:27,412 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:27,429 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:15:27,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27 WrapperNode [2019-01-11 21:15:27,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:27,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:27,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:15:27,431 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:15:27,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:27,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:15:27,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:15:27,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:15:27,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... [2019-01-11 21:15:27,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:15:27,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:15:27,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:15:27,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:15:27,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:15:27,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:15:27,872 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:15:28,855 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:15:28,855 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:15:28,856 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:15:28,857 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:15:28,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:28 BoogieIcfgContainer [2019-01-11 21:15:28,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:15:28,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:15:28,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:15:28,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:15:28,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:15:26" (1/3) ... [2019-01-11 21:15:28,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6574542a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:28, skipping insertion in model container [2019-01-11 21:15:28,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:27" (2/3) ... [2019-01-11 21:15:28,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6574542a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:28, skipping insertion in model container [2019-01-11 21:15:28,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:28" (3/3) ... [2019-01-11 21:15:28,866 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:28,876 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:15:28,884 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:15:28,896 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:15:28,928 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:15:28,929 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:15:28,929 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:15:28,929 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:15:28,929 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:15:28,929 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:15:28,930 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:15:28,930 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:15:28,930 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:15:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-01-11 21:15:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:15:28,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:28,960 INFO L402 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] [2019-01-11 21:15:28,962 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:28,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:28,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1457700992, now seen corresponding path program 1 times [2019-01-11 21:15:28,972 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:28,973 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:28,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:29,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:15:29,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:15:29,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:29,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:29,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:29,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:29,183 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-01-11 21:15:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:29,736 INFO L93 Difference]: Finished difference Result 248 states and 423 transitions. [2019-01-11 21:15:29,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:29,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:15:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:29,759 INFO L225 Difference]: With dead ends: 248 [2019-01-11 21:15:29,760 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 21:15:29,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-01-11 21:15:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 21:15:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-11 21:15:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 21:15:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-01-11 21:15:29,837 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 24 [2019-01-11 21:15:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:29,838 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-01-11 21:15:29,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-01-11 21:15:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 21:15:29,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:29,844 INFO L402 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] [2019-01-11 21:15:29,844 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1997570754, now seen corresponding path program 1 times [2019-01-11 21:15:29,845 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:29,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:29,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:15:29,996 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:29,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:30,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:30,004 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-01-11 21:15:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:30,353 INFO L93 Difference]: Finished difference Result 234 states and 356 transitions. [2019-01-11 21:15:30,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:30,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-11 21:15:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:30,357 INFO L225 Difference]: With dead ends: 234 [2019-01-11 21:15:30,357 INFO L226 Difference]: Without dead ends: 131 [2019-01-11 21:15:30,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-01-11 21:15:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-11 21:15:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-01-11 21:15:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-11 21:15:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-01-11 21:15:30,372 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 37 [2019-01-11 21:15:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:30,373 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-01-11 21:15:30,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-01-11 21:15:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 21:15:30,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:30,375 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:30,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:30,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:30,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1599062901, now seen corresponding path program 1 times [2019-01-11 21:15:30,377 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:30,377 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:30,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:30,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:15:30,482 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:30,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:30,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:30,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:30,485 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-01-11 21:15:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:30,789 INFO L93 Difference]: Finished difference Result 267 states and 402 transitions. [2019-01-11 21:15:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:30,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-11 21:15:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:30,791 INFO L225 Difference]: With dead ends: 267 [2019-01-11 21:15:30,791 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 21:15:30,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-01-11 21:15:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 21:15:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-01-11 21:15:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-11 21:15:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-01-11 21:15:30,806 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 51 [2019-01-11 21:15:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:30,806 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-01-11 21:15:30,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-01-11 21:15:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 21:15:30,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:30,809 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:15:30,809 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -771507572, now seen corresponding path program 1 times [2019-01-11 21:15:30,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:30,811 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:30,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:30,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:15:30,921 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:15:30,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:30,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:30,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:30,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:30,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:30,926 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-01-11 21:15:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:31,040 INFO L93 Difference]: Finished difference Result 412 states and 606 transitions. [2019-01-11 21:15:31,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:31,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-11 21:15:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:31,048 INFO L225 Difference]: With dead ends: 412 [2019-01-11 21:15:31,048 INFO L226 Difference]: Without dead ends: 277 [2019-01-11 21:15:31,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-01-11 21:15:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-11 21:15:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-01-11 21:15:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-11 21:15:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 402 transitions. [2019-01-11 21:15:31,086 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 402 transitions. Word has length 68 [2019-01-11 21:15:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:31,087 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 402 transitions. [2019-01-11 21:15:31,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 402 transitions. [2019-01-11 21:15:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 21:15:31,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:31,093 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:15:31,094 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:31,094 INFO L82 PathProgramCache]: Analyzing trace with hash -630958962, now seen corresponding path program 1 times [2019-01-11 21:15:31,094 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:31,095 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:31,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:31,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:15:31,231 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:31,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:31,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:31,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:31,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:31,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:31,238 INFO L87 Difference]: Start difference. First operand 277 states and 402 transitions. Second operand 3 states. [2019-01-11 21:15:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:31,353 INFO L93 Difference]: Finished difference Result 565 states and 818 transitions. [2019-01-11 21:15:31,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:31,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-11 21:15:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:31,358 INFO L225 Difference]: With dead ends: 565 [2019-01-11 21:15:31,358 INFO L226 Difference]: Without dead ends: 298 [2019-01-11 21:15:31,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-01-11 21:15:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-11 21:15:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-01-11 21:15:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:15:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 429 transitions. [2019-01-11 21:15:31,375 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 429 transitions. Word has length 68 [2019-01-11 21:15:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:31,375 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 429 transitions. [2019-01-11 21:15:31,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 429 transitions. [2019-01-11 21:15:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 21:15:31,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:31,378 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:15:31,378 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash -207312240, now seen corresponding path program 1 times [2019-01-11 21:15:31,379 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:31,379 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:31,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:31,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 21:15:31,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:31,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:31,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:31,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:31,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:31,545 INFO L87 Difference]: Start difference. First operand 298 states and 429 transitions. Second operand 3 states. [2019-01-11 21:15:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:31,705 INFO L93 Difference]: Finished difference Result 613 states and 879 transitions. [2019-01-11 21:15:31,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:31,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-11 21:15:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:31,709 INFO L225 Difference]: With dead ends: 613 [2019-01-11 21:15:31,709 INFO L226 Difference]: Without dead ends: 325 [2019-01-11 21:15:31,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-01-11 21:15:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-11 21:15:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-01-11 21:15:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-11 21:15:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 463 transitions. [2019-01-11 21:15:31,725 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 463 transitions. Word has length 68 [2019-01-11 21:15:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:31,725 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 463 transitions. [2019-01-11 21:15:31,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 463 transitions. [2019-01-11 21:15:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 21:15:31,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:31,728 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-11 21:15:31,728 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:31,729 INFO L82 PathProgramCache]: Analyzing trace with hash -745334804, now seen corresponding path program 1 times [2019-01-11 21:15:31,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:31,730 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:31,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:31,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-11 21:15:31,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:31,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:31,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:31,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:31,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:31,899 INFO L87 Difference]: Start difference. First operand 325 states and 463 transitions. Second operand 3 states. [2019-01-11 21:15:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:32,193 INFO L93 Difference]: Finished difference Result 661 states and 961 transitions. [2019-01-11 21:15:32,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:32,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-01-11 21:15:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:32,196 INFO L225 Difference]: With dead ends: 661 [2019-01-11 21:15:32,196 INFO L226 Difference]: Without dead ends: 373 [2019-01-11 21:15:32,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-01-11 21:15:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-01-11 21:15:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 367. [2019-01-11 21:15:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 21:15:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 515 transitions. [2019-01-11 21:15:32,213 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 515 transitions. Word has length 86 [2019-01-11 21:15:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:32,214 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 515 transitions. [2019-01-11 21:15:32,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 515 transitions. [2019-01-11 21:15:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:15:32,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:32,216 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-11 21:15:32,216 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:32,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:32,217 INFO L82 PathProgramCache]: Analyzing trace with hash 944105636, now seen corresponding path program 1 times [2019-01-11 21:15:32,217 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:32,217 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:32,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:32,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-11 21:15:32,393 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (9)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:15:32,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:32,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:32,404 INFO L87 Difference]: Start difference. First operand 367 states and 515 transitions. Second operand 3 states. [2019-01-11 21:15:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:32,947 INFO L93 Difference]: Finished difference Result 783 states and 1140 transitions. [2019-01-11 21:15:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:32,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:15:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:32,952 INFO L225 Difference]: With dead ends: 783 [2019-01-11 21:15:32,952 INFO L226 Difference]: Without dead ends: 453 [2019-01-11 21:15:32,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-01-11 21:15:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-01-11 21:15:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 447. [2019-01-11 21:15:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-11 21:15:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 605 transitions. [2019-01-11 21:15:32,970 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 605 transitions. Word has length 106 [2019-01-11 21:15:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:32,970 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 605 transitions. [2019-01-11 21:15:32,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 605 transitions. [2019-01-11 21:15:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:15:32,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:32,973 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-11 21:15:32,974 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:32,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1389287002, now seen corresponding path program 1 times [2019-01-11 21:15:32,975 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:32,975 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:33,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:33,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:15:33,136 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:33,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:33,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:33,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:33,141 INFO L87 Difference]: Start difference. First operand 447 states and 605 transitions. Second operand 3 states. [2019-01-11 21:15:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:33,468 INFO L93 Difference]: Finished difference Result 1048 states and 1426 transitions. [2019-01-11 21:15:33,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:33,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:15:33,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:33,474 INFO L225 Difference]: With dead ends: 1048 [2019-01-11 21:15:33,474 INFO L226 Difference]: Without dead ends: 638 [2019-01-11 21:15:33,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-01-11 21:15:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-01-11 21:15:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-01-11 21:15:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-01-11 21:15:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 863 transitions. [2019-01-11 21:15:33,496 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 863 transitions. Word has length 106 [2019-01-11 21:15:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:33,497 INFO L480 AbstractCegarLoop]: Abstraction has 638 states and 863 transitions. [2019-01-11 21:15:33,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 863 transitions. [2019-01-11 21:15:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:15:33,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:33,501 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-11 21:15:33,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1523300508, now seen corresponding path program 1 times [2019-01-11 21:15:33,502 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:33,502 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:33,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:33,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-11 21:15:33,683 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:33,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:33,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:33,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:33,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:33,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:33,688 INFO L87 Difference]: Start difference. First operand 638 states and 863 transitions. Second operand 3 states. [2019-01-11 21:15:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:33,877 INFO L93 Difference]: Finished difference Result 1264 states and 1709 transitions. [2019-01-11 21:15:33,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:33,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:15:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:33,884 INFO L225 Difference]: With dead ends: 1264 [2019-01-11 21:15:33,886 INFO L226 Difference]: Without dead ends: 663 [2019-01-11 21:15:33,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-01-11 21:15:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-01-11 21:15:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-01-11 21:15:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-01-11 21:15:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 893 transitions. [2019-01-11 21:15:33,911 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 893 transitions. Word has length 106 [2019-01-11 21:15:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:33,912 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 893 transitions. [2019-01-11 21:15:33,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 893 transitions. [2019-01-11 21:15:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-11 21:15:33,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:33,916 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2019-01-11 21:15:33,916 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash 888668032, now seen corresponding path program 1 times [2019-01-11 21:15:33,917 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:33,918 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:33,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:34,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:15:34,053 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:34,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:34,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:34,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:34,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:34,058 INFO L87 Difference]: Start difference. First operand 663 states and 893 transitions. Second operand 3 states. [2019-01-11 21:15:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:34,836 INFO L93 Difference]: Finished difference Result 1369 states and 1875 transitions. [2019-01-11 21:15:34,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:34,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-01-11 21:15:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:34,842 INFO L225 Difference]: With dead ends: 1369 [2019-01-11 21:15:34,842 INFO L226 Difference]: Without dead ends: 743 [2019-01-11 21:15:34,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 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-01-11 21:15:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-01-11 21:15:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 732. [2019-01-11 21:15:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-01-11 21:15:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 977 transitions. [2019-01-11 21:15:34,876 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 977 transitions. Word has length 131 [2019-01-11 21:15:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:34,877 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 977 transitions. [2019-01-11 21:15:34,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 977 transitions. [2019-01-11 21:15:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-11 21:15:34,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:34,881 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2019-01-11 21:15:34,882 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:34,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:34,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2026196904, now seen corresponding path program 1 times [2019-01-11 21:15:34,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:34,883 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:34,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:35,849 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:15:35,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:15:35 BoogieIcfgContainer [2019-01-11 21:15:35,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:15:35,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:15:35,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:15:35,975 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:15:35,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:28" (3/4) ... [2019-01-11 21:15:35,979 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:15:36,179 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:15:36,180 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:15:36,185 INFO L168 Benchmark]: Toolchain (without parser) took 9215.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 946.0 MB in the beginning and 927.7 MB in the end (delta: 18.3 MB). Peak memory consumption was 230.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:36,187 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:15:36,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.05 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:36,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -211.6 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:36,189 INFO L168 Benchmark]: Boogie Preprocessor took 74.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:36,189 INFO L168 Benchmark]: RCFGBuilder took 1209.14 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:36,190 INFO L168 Benchmark]: TraceAbstraction took 7114.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 941.9 MB in the end (delta: 149.0 MB). Peak memory consumption was 213.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:36,190 INFO L168 Benchmark]: Witness Printer took 205.47 ms. Allocated memory is still 1.2 GB. Free memory was 941.9 MB in the beginning and 927.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:36,193 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 461.05 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -211.6 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1209.14 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7114.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 941.9 MB in the end (delta: 149.0 MB). Peak memory consumption was 213.0 MB. Max. memory is 11.5 GB. * Witness Printer took 205.47 ms. Allocated memory is still 1.2 GB. Free memory was 941.9 MB in the beginning and 927.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 618]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int __retres1 ; [L8] int s__info_callback = __VERIFIER_nondet_int(); [L9] int s__in_handshake = __VERIFIER_nondet_int(); [L10] int s__state ; [L11] int s__new_session ; [L12] int s__server ; [L13] int s__version = __VERIFIER_nondet_int(); [L14] int s__type ; [L15] int s__init_num ; [L16] int s__bbio = __VERIFIER_nondet_int(); [L17] int s__wbio = __VERIFIER_nondet_int(); [L18] int s__hit = __VERIFIER_nondet_int(); [L19] int s__rwstate ; [L20] int s__init_buf___0 ; [L21] int s__debug = __VERIFIER_nondet_int(); [L22] int s__shutdown ; [L23] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L24] int s__ctx__stats__sess_connect_renegotiate ; [L25] int s__ctx__stats__sess_connect ; [L26] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L27] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [L28] int s__s3__change_cipher_spec ; [L29] int s__s3__flags ; [L30] int s__s3__delay_buf_pop_ret ; [L31] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L32] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__next_state___0 ; [L37] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L38] int s__session__cipher ; [L39] int s__session__compress_meth ; [L40] int buf ; [L41] unsigned long tmp ; [L42] unsigned long l ; [L43] int num1 ; [L44] int cb ; [L45] int ret ; [L46] int new_state ; [L47] int state ; [L48] int skip ; [L49] int tmp___0 ; [L50] int tmp___1 ; [L51] int tmp___2 ; [L52] int tmp___3 ; [L53] int tmp___4 ; [L54] int tmp___5 ; [L55] int tmp___6 = __VERIFIER_nondet_int(); [L56] int tmp___7 = __VERIFIER_nondet_int(); [L57] int tmp___8 = __VERIFIER_nondet_int(); [L58] int tmp___9 = __VERIFIER_nondet_int(); [L59] int blastFlag ; [L60] int ag_X ; [L61] int ag_Y ; [L62] int ag_Z = __VERIFIER_nondet_int(); [L63] unsigned int ag_V ; [L64] unsigned int ag_W ; [L65] int __retres62 ; [L68] ag_V = 2U [L69] ag_W = 5U [L70] s__state = 12292 [L71] blastFlag = 0 [L72] tmp = __VERIFIER_nondet_int() [L73] cb = 0 [L74] ret = -1 [L75] skip = 0 [L76] tmp___0 = 0 [L77] COND TRUE s__info_callback != 0 [L78] cb = s__info_callback [L86] s__in_handshake = s__in_handshake + 1 [L87] tmp___1 = __VERIFIER_nondet_int() [L88] COND FALSE !(tmp___1 & 12288) [L99] COND TRUE 1 [L101] state = s__state [L102] COND TRUE s__state == 12292 [L205] s__new_session = 1 [L206] s__state = 4096 [L207] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L212] s__server = 0 [L213] COND TRUE cb != 0 [L218] COND FALSE !((s__version & 65280) != 768) [L224] s__type = 4096 [L225] COND FALSE !(s__init_buf___0 == 0) [L244] tmp___4 = __VERIFIER_nondet_int() [L245] COND FALSE !(! tmp___4) [L251] tmp___5 = __VERIFIER_nondet_int() [L252] COND FALSE !(! tmp___5) [L258] s__state = 4368 [L259] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L260] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND TRUE s__state == 4368 [L264] s__shutdown = 0 [L265] ret = __VERIFIER_nondet_int() [L266] COND TRUE blastFlag == 0 [L267] blastFlag = 1 [L271] COND FALSE !(ret <= 0) [L276] s__state = 4384 [L277] s__init_num = 0 [L278] COND TRUE s__bbio != s__wbio [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND TRUE s__state == 4384 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L292] COND FALSE !(ret <= 0) [L297] COND FALSE !(\read(s__hit)) [L300] s__state = 4400 [L302] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND TRUE s__state == 4400 [L306] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L309] ret = __VERIFIER_nondet_int() [L310] COND TRUE blastFlag == 2 [L311] blastFlag = 3 [L315] COND FALSE !(ret <= 0) [L321] s__state = 4416 [L322] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND TRUE s__state == 4416 [L326] ret = __VERIFIER_nondet_int() [L327] COND TRUE blastFlag == 3 [L328] blastFlag = 4 [L332] COND FALSE !(ret <= 0) [L337] s__state = 4432 [L338] s__init_num = 0 [L339] COND FALSE !(! tmp___6) [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L348] ret = __VERIFIER_nondet_int() [L349] COND FALSE !(blastFlag == 5) [L354] COND FALSE !(ret <= 0) [L359] s__state = 4448 [L360] ag_X = 44 [L361] ag_Y = 100 [L362] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND FALSE !(s__state == 4432) [L144] COND FALSE !(s__state == 4433) [L147] COND TRUE s__state == 4448 [L366] ret = __VERIFIER_nondet_int() [L367] COND TRUE blastFlag == 4 [L368] blastFlag = 5 [L372] COND FALSE !(ret <= 0) [L377] COND TRUE \read(s__s3__tmp__cert_req) [L378] s__state = ag_X * ag_Y + ag_Z [L382] s__init_num = 0 [L576] COND FALSE !(! s__s3__tmp__reuse_message) [L605] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L348] ret = __VERIFIER_nondet_int() [L349] COND TRUE blastFlag == 5 [L618] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. UNSAFE Result, 7.0s OverallTime, 12 OverallIterations, 8 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2108 SDtfs, 381 SDslu, 1270 SDs, 0 SdLazy, 675 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 840 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1003 NumberOfCodeBlocks, 1003 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 840 ConstructedInterpolants, 0 QuantifiedInterpolants, 119674 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1361 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 835/835 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...